#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream in("order.in");
ofstream out("order.out");
const int maxn = 30005;
int v[maxn];
queue <int> q;
int main()
{
    int n;
    in >> n;
    for(int i = 2; i <= n; i++)
        q.push(i);
    q.push(1);
    int pas = 1;
    while(q.size() >= 2)
    {
        out << q.front() << " ";
        q.pop();
        int op = pas % q.size();
        for(int i = 1; i <= op; i++)
        {
            q.push(q.front());
            q.pop();
        }
        pas++;
    }
    out << q.front() << "\n";
    return 0;
}