#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e9+7;
const ll NMAX=1e7;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

using namespace std;

ll t[NMAX];

ifstream f("order.in");
ofstream g("order.out");

void build(int v, int tl, int tr) {
	if (tl==tr) {
		t[v]=1;
	}
	else {
		int tm=(tl+tr)/2;
		build(2*v,tl,tm);
		build(2*v+1,tm+1,tr);
		t[v]=t[2*v]+t[2*v+1];
	}
}

void update(int v, int tl, int tr, int pos) {
	if (tl==tr) {
		g << tl << " ";
		t[v]=0;
		return;
	}
	else {
		int tm=(tl+tr)/2;
		if (pos<=t[2*v]) {
			update(2*v,tl,tm,pos);
		}
		else {
			update(2*v+1,tm+1,tr,pos-t[v*2]);
		}
		t[v]=t[v*2]+t[v*2+1];
	}
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n;
	f >> n;
	int pos=1;
	build(1,1,n);
	for (int i=1; i<=n; i++) {
		if (pos+i<=t[1])pos+=i;
		else pos=(pos+i-1)%t[1]+1;
		update(1,1,n,pos);
		pos--;
	}

}