#include <cstdio>
#define NMax 30000

int aib[NMax+1];
int N;

void Update(int p, int x)
{
    while(p <= N)
    {
        aib[p] += x;
        p = p + ( p & (-p) );
    }
}

int Query(int p)
{
    int res=0;
    while(p > 0)
    {
        res += aib[p];
        p = p - ( p & (-p) );
    }
    return res;
}

int GetNr(int st, int dr)
{
    if( dr <= N ) return Query(dr) - Query(st);
    return Query(N) - Query(st) + Query(dr-N);
}

int main(){
    freopen("order.in","r",stdin);
    freopen("order.out","w",stdout);

    int i,x,f,p,st,dr,mid;

    scanf("%d",&N);
    for(i = 1; i <= N; ++i) Update(i,1);

    printf("2 ");
    Update(2,-1);
    for(f = i = 2; i < N; ++i)
    {
        if( i > N-i+1 ) x = i % ( N-i+1 );
        else x = i;
        if(!x) x = N-i+1;

        for(st = f, dr = f+N-1; st <= dr; )
        {
            mid = (st+dr)/2;
            if( GetNr(f,mid) > x ) dr = mid-1;
            else if( GetNr(f,mid) < x ) st = mid+1;
            else { p = mid; dr = mid-1; }
        }
        f = (p > N ? p-N : p);
        Update(f,-1);
        printf("%d ",f);
    }

    for(i = 1; i <= N; ++i)
    if( aib[i] ) { printf("%d\n",i); break; }


return 0;
}