#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 30000;

int aib[1 + NMAX + 1], n;

void update( int p, int val ) {
  for( p; p <= n; p += p & (-p) )
    aib[p] += val;
}

int cb( int x ) {
  int pas;
  for( pas = 1; pas <= n; pas *= 2 );
  int r = 0;
  while( pas ) {
    if( r + pas <= n && aib[r + pas] < x ) {
      x -= aib[r + pas];
      r += pas;
    }
    pas /= 2;
  }
  return r + 1;
}

int main() {
    fin>>n;
    for( int i = 1; i <= n; i ++ ) {
      update(i, 1);
    }
    int sz = n;
    int tosearch = 1;
    for( int i = 1; i <= n; i ++ ) {
      tosearch += i;
      tosearch %= sz;
      int poz;
      if( tosearch == 0 )
        tosearch = sz;
      poz = cb(tosearch);
      update(poz, -1);
      fout<<poz<<" ";
      sz --;
      tosearch --;
    }
    return 0;
}