#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<int> solve(ll k) {
	vector<int> a;
	if (k <= 4) {
		while (--k) a.push_back(n++);
		reverse(a.begin(), a.end());
	}
	else if (k % 2 == 0) {
		a = solve(k / 2), a.push_back(n++);
	}
	else if (k % 4 == 1) {
		a = solve(k - 1), a.insert(a.begin(), n++);
	}
	else {
		a = solve(k - 3), a.insert(a.begin() + 2, n++);
	}
	return a;
}
vector<int> construct_permutation(ll k) { n = 0; return solve(k); }