#include<fstream>

using namespace std;

int i, n, j;
typedef struct nod{int info; nod *urm;}lista;
lista *prim, *ultim, *q, *r;

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

int main()
{
	f>>n;
	
	prim=new  lista;
	ultim=new lista;
	prim->info=1;
	ultim->info=2;
	prim->urm=ultim;
	ultim->urm=prim;
	
	for(i=3;i<=n;i++)
	{
		q=new lista;
		q->info=i;
		q->urm=prim;
		ultim->urm=q;
		ultim=q;
	}

	for(i=1;i<=n;i++)
	{
		for(j=1;j<=(i-1);j++)
				q=q->urm;
		g<<q->urm->info<<" ";
		r=q->urm;
		q->urm=q->urm->urm;
		delete r;
	}
	return 0;
}