#include <deque>
using namespace std;

int main() {
    int n;
    cin >> n;
    deque<int> q;
    for (int k = n; k >= 1; k--) {
        q.push_back(k);
        int len = q.size();
        int rot = k % len;
        for (int i = 0; i < rot; i++) {
            int val = q.back();
            q.pop_back();
            q.push_front(val);
        }
    }
    for (int i = 0; i < n; i++) {
        if (i) cout << " ";
        cout << q[i];
    }
    cout << endl;
    return 0;
}