#include<fstream>
using namespace std;

ifstream f("order.in");
ofstream g("order.out");

int n,val,poz,c,rez,i;
int tree[1<<16+10];

void update(int nod, int left, int right)
{if(right==left)
  {tree[nod]=val; 
   return;}
 int mij=(left+right)/2;
 if(poz<=mij)
    update(2*nod,left,mij);
 else 
    update(2*nod+1,mij+1,right);
 tree[nod]=tree[2*nod]+tree[2*nod+1];     
}

void search(int nod, int left, int right)
{if(right==left)
  {rez=left;
   return;}
 int mij=(left+right)/2;
 if(val<=tree[2*nod])
     search(2*nod,left,mij);
 else
   {val=val-tree[2*nod];
    search(2*nod+1,mij+1,right);}     
}

int main()
{f>>n;
for(i=1; i<=n ;i++)
{val=1;
 poz=i;
 update(1,1,n);
}

c=2;
for(i=0; i<n; i++)
{
c=(c+i-1)%(n-i)+1;
val=c;
search(1,1,n);
g<<rez<<" ";
val=0;
poz=rez;
update(1,1,n);
}


f.close();
g.close();
return 0;}