#include <cstdio>
#include <stack>
#include <queue>
using namespace std;
int n, p[1000];
stack<int> a, b, c;
queue<int> q;
int main() {
    freopen("xqz.in", "r", stdin);
    freopen("xqz.out", "w", stdout);
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
        q.push(i);
    for(; ; ) {
        a.push(q.front());
        q.pop();
        if(a.size() > 4) {
            for(int i=0; i<4; i++) {
                q.push(a.top());
                a.pop();
            }
            b.push(a.top());
            a.pop();
            if(b.size() > 11) {
                for(int i=0; i<4; i++) {
                    q.push(b.top());
                    b.pop();
                }
                c.push(b.top());
                b.pop();
                if(c.size() > 11) {
                    for(int i=0; i<11; i++) {
                        q.push(c.top());
                        c.pop();
                    }
                    q.push(c.top());
                    c.pop();
                    break;
                }
            }
        }
    }
    int j = 1;
    while(!q.empty()) {
        p[j++] = q.front();
        q.pop();
        fprintf(stderr, "%d ", p[j-1]);
    }
    return 0;
}