#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
ifstream f("order.in");
ofstream g("order.out");
template<class T>using oset=tree<T,null_type,less<T>,
rb_tree_tag,tree_order_statistics_node_update>;
oset<int>s;
int n;
int main(){
    f>>n;
    for (int i=1; i<=n; ++i) {
        s.insert(i);
    }
    s.insert(1e9);
    int poz=1;
    for (int i=1; i<=n; ++i) {
        poz=(poz+i-1)%(n-i+1);
        if (poz==0) poz=n-i+1;
        auto it=s.find_by_order(poz);
        g<<(*it==1e9?1:*it)<<' ';
        s.erase(it);
    }
    system("pause");
    return 0;
}