#include<fstream>
#include<algorithm>
using namespace std;
struct nod{
  int inf;
  nod* ant, *urm;
};

void sterg(nod*&v, nod*&u, nod*&x){
  nod*p;
  p=x;  
  x->ant->urm=x->urm;
  x->urm->ant=x->ant;
  x=x->ant;
  delete p;
}
nod* v=0,*u,*p;
int main(){
  int n,k,ct,i;
  ifstream f("order.in");
  f>>n;
  ct=n;
  f.close();
  
  u=0;
  v->inf=1;
  u->inf=2;
  v->urm=u;
  v->ant=u;
  u->ant=v;
  u->urm=v;
  for(i=3;i<=n;i++){
   p=new nod;
   p->inf=i;
   p->ant=u;
   p->urm=v;
   u->urm=p;
   u=p;
   v->ant=u;
  }
  ofstream g("order.out");
  p=v;
  for(i=1;i<=n;i++){
   k=i%ct;
   while(k--)  p=p->urm;
   g<<p->inf<<' ';
   sterg(v,u,p);
   ct--;

  }
  g<<'\n';
  return 0;
}