// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

#include "perm.h"

namespace {
	const int N = 100;
	int a[N];
}

std::vector<int> construct_permutation(long long k) {
	bool op = 0;
	int h = 0;
	for (int i = 0; i < 60; i++)
		if (k >> i & 1) h = i;
	int n = 0;
	for (int i = h - 1; i >= 0; i--) {
		++n;
		a[n] = n;
		int x = -1, y = -1;
		for (int j = 1; j <= n; j++) {
			if (a[j] == 1) x = j;
			if (a[j] == 2) y = j;
		}
		if (i > 0 && (k >> i & 1) && (k >> (i - 1) & 1) && x != -1 && y != -1 && y < x) {
			++n;
			a[n] = n;
			a[++n] = 3;
			for (int j = 1; j < n; j++)
				if (a[j] >= 3) a[j]++;
			i = i - 1;
			continue;
		}
		if (k >> i & 1) {
			++n;
			a[n] = 1;
			for (int j = 1; j < n; j++) a[j]++;
		}
	}
	vector<int> res;
	for (int i = 1; i <= n; i++) res.pb(a[i] - 1);
	return res;
}