#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 30000 + 5;

int n, rem, index = 1, last = 2;
int aib[NMAX];

int zeros(int x)
{
    return x ^ (x & (x - 1));
}

void update(int poz, int val)
{
    for (int i = poz; i <= n; i += zeros(i))
        aib[i] += val;
}

int query(int poz)
{
    int rez = 0;
    for (int i = poz; i; i -= zeros(i))
        rez += aib[i];
    return rez;
}

int bin_search(int i)
{
    int st = 1, dr = n, mijl, ans;
    while (st <= dr)
    {
        mijl = (st + dr) / 2;
        if (query(mijl) >= i)
        {
            dr = mijl - 1;
            ans = mijl;
        }
        else
            st = mijl + 1;
    }

    update(ans, -1);
    --rem;

    return ans;
}

void read()
{
    fin >> n;
    rem = n;
    for (int i = 1; i <= n; ++i)
        update(i, 1);
}

int main()
{
    read();
    int x = 2;
    for (int i = 1; i <= n; ++i)
    {
        x = (x + i - 1) % (n - i + 1);
        if (x == 0)
            x = n - i + 1;

        fout << bin_search(x) << " ";
    }

    return 0;
}