#include <bits/stdc++.h>
#define lsb(x) (x&(-x))
#define NMAX 30002

using namespace std;

ifstream fin("order.in");
ofstream fout("order.out");

struct AIB{
    vector <int> aib;
    AIB (int N){
        aib.resize(N+1);
    }

    void update(int pos,int val){
        for(int i=pos;i<(int)aib.size();i+=lsb(i)){
            aib[i]+=val;
        }
    }

    int query(int pos){
        int ret=0;
        for(int i=pos;i>0;i-=lsb(i)){
            ret+=aib[i];
        }
        return ret;
    }

    int find(int val){
        int ans=0;
        int sum_ans=0;
        for(int pas=(1<<18);pas>0;pas>>=1){
            if(ans+pas>=(int)aib.size()) {continue;}
            if(sum_ans+aib[ans+pas]<val){
                ans+=pas;
                sum_ans+=aib[ans];
            }
        }
        return ans;
    }
};

int N;

int main()
{
    // ios::sync_with_stdio(0);
    // cin.tie(0); cout.tie(0);
    fin >> N;
    AIB aib(N+2);
    for(int i=1;i<=N;i++){
        aib.update(i,1);
    }
    int cur=1,step=1;
    vector <int> elimin;
    int eliminate=0;
    for(int i= 1;i<=N;i++){
        if(cur+step>N-eliminate){
            cur-=N-eliminate;
            for(int elm:elimin){
                aib.update(elm,-1);
                eliminate++;
            }
            elimin.resize(0);
        }
        // cout << (cur+step) << " , " << N-eliminate  << "\n";
        cur=aib.find((cur+step-1)%(N-eliminate)+1)+1;
        elimin.push_back(cur);
        fout << cur << " ";
        step++;
    }
    return 0;
}