#include <cstdio>
#define lb(x) (x&(-x))
#define nmax 30030

using namespace std;

int n, i, x, ind, out_pos=2;
int aib[nmax];
int sol[nmax];

void tree_update(int position, int value)
{
    for(int i=position; i<=n; i+=lb(i)) aib[i]+=value;
}

int tree_query(int position)
{
    int s=0;
    for(int i=position; i>0; i-=lb(i)) s+=aib[i];
    return s;
}
int binary_search(int x)
{
    int left=1, right=n, mid, sum, minn=0x3f3f3f3f;

    while(left<=right)
    {
        mid=(left+right)>>1;
        sum=tree_query(mid);
        if(sum==x && mid<minn) minn=mid;
        else if(sum>=x) right=mid-1;
        else left=mid+1;
    }
    return minn;
}
int mod(int x, int MOD)
{
    if(!(x%MOD)) return MOD;

    return x%MOD;
}
int main()
{
    freopen("order.in", "rt", stdin);
    freopen("order.out", "wt", stdout);

    scanf("%d", &n);

    for(i=1; i<=n; ++i) tree_update(i, 1);
    ind=n;

    for(i=1; i<=n; ++i)
    {
        --ind;
        x=binary_search(out_pos);
        tree_update(x, -1);

        sol[i]=x;
        out_pos+=i;

        if(ind!=0) out_pos=mod(out_pos, ind);
    }

    for(i=1; i<=n; ++i)
    printf("%d ", sol[i]);
    return 0;
}