#include<queue>
#include<iostream>
using namespace std;
int main()
{
queue<int> q;
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
q.push(i);
}
while (n >= 2)
{
//顶部元素出队
cout << q.front() << ' ';
q.pop(); n--;
//次顶部元素排到队尾
int temp = q.front();
q.push(temp);
q.pop();
}cout << q.front();
return 0;
}