#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <cstring>
#include <deque>
#include <stack>
#include <bitset>
#include <list>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp(a,b) make_pair (a, b)
#define ll long long
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define lsb(a) (a & (-a))

using namespace std;

int N, aux;
int Aib[32769];
ofstream fout ("order.out");

void Citire () {
    ifstream fin ("order.in");
    fin >> N;
    for (aux = 1; aux < N; aux <<= 1);
    fin.close ();
}

void Update (int nod, int val) {
    for (; nod <= aux; nod += lsb (nod))
        Aib[nod] += val;
}

int Query (int nod) {
    int S = 0;
    for (; nod; nod -= lsb (nod))
        S += Aib[nod];
    return S;
}

int B_Search (int val) {
    int i = aux, step = aux;
    for (; step; step >>= 1)
    {
        if (i - step >= 1)
        {
            if (Aib[i - step] >= val) i -= step;
            else
            {
                val -= Aib[i - step];
                if (!val) return i - step;
            }
        }
    }
    return i;
}

int main () {
    Citire ();
    for (int i = 1; i <= N; i++)
        Update (i, 1);
    for (int i = 1, pas = 1, a; i <= N; i++)
    {
        int val = (i + Query (pas)) % Query (N);
        if (val == 0)
        {
            pas = 0;
            a = B_Search (N - i + 1);
            Update (a, -1);
            fout << a << " ";
        }
        else
        {
            a = B_Search (val);
            Update (a, -1);
            fout << a << " ";
            pas = a;
        }
    }
    return 0;
}