#include <fstream>
using namespace std;
ifstream fin("order.in");
ofstream fout("order.out");
struct node {
    int val;
    int left;
    int right;
};
node aint[500001];
int ultimul_scos = 0;
void build(int nod, int st, int dr, int val){
    if (val == 1){
        aint[nod].val = val;
        aint[nod].left = st;
        aint[nod].right = dr;
        return;
    }
    int mid = (st + dr) / 2;
    build(2 * nod, st, mid, ((val / 2) + val % 2));
    build(2 * nod + 1, (mid + 1), dr, (val / 2));
    aint[nod].val = val;
    aint[nod].left = st;
    aint[nod].right = dr;
}
void remove(int nod, int val){
    if (aint[nod].val == 1 && aint[2 * nod].val == 0 && aint[2 * nod + 1].val == 0){
        aint[nod].val--;
        ultimul_scos = aint[nod].left;
        return;
    }
    aint[nod].val--;
    if (val <= aint[2 * nod].val && aint[2 * nod].val != 0){
        remove(2 * nod, val);
    } else if (aint[2 * nod + 1].val != 0){
        remove(2 * nod + 1, (val - aint[2 * nod].val));
    }
}
int main() {
    int n, copie_n;
    int poz = 1;
    fin >> n;
    copie_n = n;
    build(1, 1, n, n);
    for (int i = 1; i <= copie_n; i++){
        poz += i;
        poz %= n;
        remove(1, poz);
        fout << ultimul_scos << " ";
        poz--;
        n--;
    }
    return 0;
}