#include <cstdio>
#define ub(x) (x&(-x))
# define INF (1<<20)

using namespace std;

int aib[30010],n,i,j,pp,x,nrm,summ;

void update(int i)
 {
    for (int j=i;j<=n;j+=ub(j))
     aib[j]--;
 }

int s(int x)
 {
    int rez=0;
    for (int i=x;i>0;i-=ub(i))
        rez+=aib[i];
    return rez;
 }

int cb(int x)
{
    int st=1,dr=n; int mi=INF;
    while (st<=dr)
    {
        int mij=(st+dr)/2;  int su=s(mij);
        if (su==x && mij<mi) mi=mij;
        else if (su==x) dr=mij-1;
        else if (su>x) dr=mij-1;
         else st=mij+1;
    }
    return mi;
}

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

    scanf("%d", &n);

    for (i=1;i<=n;++i) aib[i]=ub(i);

    summ=1;

    x=1; nrm=n; int uu=1;

    for (i=1;i<n;++i)
     {
         uu=i;
         uu%=nrm;
         if (i>1) summ=s(pp);
         x=uu+summ;
         x%=nrm;

         if (x==0) x=nrm;
         pp=cb(x);

         printf("%d ", pp);
         update(pp);
         nrm--;
     }

     pp=cb(1);
     printf("%d", pp);

    return 0;
}