#include <stdio.h>

int n, v[30005], nr;

typedef struct nod
{
	int x;
	nod *a;
} *pNod;
pNod lista;

int main()
{
	freopen("order.in","r",stdin);
	freopen("order.out","w",stdout);
	scanf("%d",&n);
	int i, pas, j;
	pNod q, p;

	lista = new nod;
	lista -> x = 1;
	q = lista;

	for (i = 2; i <= n; i++) 
	{
		p = new nod;
		p -> x = i;
		q -> a = p;
		q = p;
	}
	q -> a = lista;
	
	pas = 2;
	j = n;

	while (nr < n)
	{
		int t = pas % j;
		if (!t) t = pas;
		for (i = 1; i < t - 1; i++)
			lista = lista -> a;
		printf("%d ",lista -> a -> x);
		lista -> a = lista -> a -> a;
		pas++;
		nr++;
		j--;
	}
	return 0;
}