#include <bits/stdc++.h>

using namespace std;
ifstream in("order.in");
ofstream out("order.out");
const int NMAX=30002;
int n,arbint[4*NMAX+56],poz,val,v[NMAX],N,p=2,r;
void update(int nod,int left,int right){
    if(left==right){
        arbint[nod]=val;
        return ;
    }
    int mid=left+(right-left)/2;
    if(poz<=mid) update(nod*2,left,mid);
    else update(nod*2+1,mid+1,right);
    arbint[nod]=arbint[2*nod]+arbint[2*nod+1];
}
void query(int nod,int left,int right,int val){
    if(left==right){
        r=left;
        return ;
    }
    int mid=left+(right-left)/2;
    if(arbint[2*nod]>=val) query(2*nod,left,mid,val);
    else query(2*nod+1,mid+1,right,val-arbint[2*nod]);
}
int main()
{
    in>>n;
    for(int i=1;i<=n;i++){
        poz=i,val=1;
        v[i]=i;
        update(1,1,n);
    }
    N=n;
    for(int i=1;i<=n;i++){
      p%=N;
      if(p==0)
        p=N;
      query(1,1,n,p);
      out<<r<<" ";
      poz=r,val=0;
      update(1,1,n);
      p=p+i;
      N--;
    }
    return 0;
}