#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("order.in");
ofstream fout("order.out");

const int N = 30005;

int n;
vector <int> a(N, 0);

void Add(int p, int v)
{
    while(p <= n)
    {
        a[p] += v;
        p += (p^(p-1)) & p;
    }
}

int Sum(int p)
{
    int s = 0;
    while(p)
    {
        s += a[p];
        p -= (p^(p-1)) & p;
    }
    return s;
}

int bs(int val)
{
    int st = 0, dr = n, m, sum;
    while(1)
    {
        m = (st+dr) >> 1;
        sum = Sum(m);
        if(st == dr) return m;

        if(val <= sum) dr = m;
        else st = m+1;
    }
}

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
        Add(i, 1);
    for(int i=1, p = 1; i<=n; i++)
    {
        p += i;
        p %= (n-i+1);
        if(!p) p = n-i+1;
        int nr = bs(p);
        Add(nr, -1);
        p = Sum(nr);
        fout<<nr<<' ';
    }
    fout<<'\n';
    return 0;
}