1

#include <bits/stdc++.h>
using namespace std;

int main() {
	queue<int>q;
	int a;
	int n[10000];
	cin >> a;
	for (int i = 1; i <= a; i++) {
		q.push(i);
	}
	for (int i = 1; i <= a; i++) {
		n[q.front()] = i;
		q.pop();
		for (int j = 1; j <= i + 1; j++) {
			q.push(q.front());
			q.pop();
		}
	}
	for (int i = 1; i <= a; i++) {
		cout << n[i] << endl;
	}
	return 0;
}