#include <fstream>
using namespace std;

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

int v[31000],n;

void up(int poz, int x)
{
	for (int i = poz; i <= n; i += (i & -i))
		v[i] += x;
}
int cautare(int poz)
{
	int i = 0;
	for (int p = 1 << 15; p; p >>= 1)
		if (i + p <= n && v[i + p] < poz)
		{
			poz -= v[i + p];
			i += p;
		}
	return i + 1;
}

int main()
{
	f >> n;
	for (int i = 1; i <= n; ++i)
		up(i, 1);

	int k = 1, nr = n;
	for (int i = 1; i <= n; ++i)
	{
		k += i;
		k %= nr;
		if(k == 0)
        {
            k = nr;
        }

		int aux = cautare(k);

		up(aux, -1);
		nr -= 1;
		k -= 1;

		g << aux << " ";
	}
	return 0;
}