#include <fstream>

using namespace std;

ifstream fin("order.in");
ofstream fout("order.out");

const int nmax= 30000;

int prev[nmax+1], next[nmax+1];

int main(  ) {
    int n, pos= 1;
    fin>>n;
    for ( int i= 1; i<=n; ++i ) {
        prev[i]= i-1, next[i]= i+1;
    }
    prev[1]= n, next[n]= 1;

    for ( int i= 1; i<=n; ++i ) {
        for ( int j= 1; j<=i; ++j ) {
            pos= next[pos];
        }

        fout<<pos<<" ";
        prev[next[pos]]= prev[pos];
        next[prev[pos]]= next[pos];
    }
    fout<<"\n";

    return 0;
}