#include <bits/stdc++.h>
using namespace std;
int main()
{
    freopen("order.in", "r", stdin);
    freopen("order.out", "w", stdout);
    int i, n, b=0, c, next=2, mult=2;
    vector<int> v;
    scanf("%d", &n);
    for(i=1; i<=n; i++)
    {
        if(i==next)
        {
            printf("%d ", i);
            next+=mult;
            mult++;
            b=v.size()-1;
        }
        else v.push_back(i);
    }
    while(!v.empty())
    {
        c=(i+b)%(v.size());
        printf("%d ", v[c]);
        b=c-1;
        v.erase(v.begin()+c);
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}

///mess
/*#include <bits/stdc++.h>
using namespace std;
const int nmax = 100005;

struct arbore
{
    vector <int> v;
    int on=1, nr;
} arb[3*nmax];

void update(int nod, int st, int dr, int poz, int val)
{
    if(st==dr)
    {
        arb[nod].v.push_back(val);
        if(arb[nod].on==1) arb[nod].on=0;
        else arb[nod].on=1;
        return;
    }
    int m=(st+dr)>>1;
    if(poz<=m) update(nod<<1, st, m, poz, val);
    else update(nod<<1|1, m+1, dr, poz, val);
    arb[nod].on=arb[nod<<1].on+arb[nod<<1|1].on;
    arb[nod].v.push_back()
}

void query(int nod, int st, int dr, int start, int finish)
{
    if(start<=st && dr<=finish)
    {
        if(on[nod])
        return;
    }
    int m=(st=dr)>>1;
    if(start<=m) query(nod<<1, st, m, start, finish);
    if(m<finish) query(nod<<1|1, m+1, dr, start, finsih);

}

int main()
{
    freopen("mess.in", "r", stdin);
    freopen("mess.out", "w", stdout);
    int n, m, i, x, p, q, k, v[nmax];
    scanf("%d %d", &n, &m);
    while(dim<=n) dim=dim<<1;
    for(i=1; i<=n; i++)
    {
        scanf("%d", &v[i]);
        update(1, 1, n, i, v[i]);
    }

    while(m--)
    {
        scanf("%d %d", &x, &p);
        if(x==1) update(1, 1, n, i, v[i]);
        else
        {

            scanf("%d %d", &q, &k);
            query(1, 1, n, p, q);
        }
    }

    return 0;
}*/