#include <bits/stdc++.h>
using namespace std;

vector<int> compress(vector<int> a) {
	vector<int> st = a;
	sort(st.begin(), st.end());
	for (int &i: a) {
		i = lower_bound(st.begin(), st.end(), i) - st.begin();
	}
	return a;
}

vector<int> construct_permutation(long long n) {
	n--;
	vector<int> ans;
 
	long long ss = 1;
	ans.push_back(1000);
	for (long long i = 2000, cnt = 2;; i += 1000, cnt *= 2) {
		if (ss + cnt > n) break;
		ss += cnt;
		ans.push_back(i);
	}
 
	long long dif = n-ss;
	for (int i = ans.size(); i >= 0; i--) {
		int cz = (i == 0 ? 1 : ans[i-1] + 1);
		if (dif & (1LL << i)) {
			ans.push_back(cz);
		}
	}
	
	return compress(ans);
}