#include <bits/stdc++.h>

using namespace std;
ifstream fin("order.in");
ofstream fout("order.out");
const int DIM = 3e4;
int n, aint[4 * DIM + 3];

inline void build(int nod, int st, int dr) {
    if(st == dr) aint[nod] = 1;
    else {
        int mid = (st + dr) / 2;
        build(2 * nod, st, mid);
        build(2 * nod + 1, mid + 1, dr);
        aint[nod] = aint[2 * nod] + aint[2 * nod + 1];
    }
}

inline void update(int nod, int st, int dr, int poz, int val) {
    if(st == dr) aint[nod] = val;
    else {
        int mid = (st + dr) / 2;
        if(poz <= mid) update(2 * nod, st, mid, poz, val);
        else update(2 * nod + 1, mid + 1, dr, poz, val);
        aint[nod] = aint[2 * nod] + aint[2 * nod + 1];
    }
}

inline int query(int nod, int st, int dr, int x) {
    ///al xlea copil ramas
    if(st == dr) return st;
    else {
        int mid = (st + dr) / 2;
        if(x <= aint[2 * nod]) return query(2 * nod, st, mid, x);
        else return query(2 * nod + 1, mid + 1, dr, x - aint[2 * nod]);
    }
}

int main()
{
    fin >> n;
    build(1, 1, n);
    int poz = 1;
    for(int pas=1; pas<=n; pas++) {
        int ramasi = n - pas + 1;
        poz = (poz + pas - 1) % ramasi; ///pas pasi mai incolo
        int x = query(1, 1, n, poz + 1);
        fout << x << " ";
        update(1, 1, n, x, 0);
    }

    return 0;
}