#include <cmath> #include <vector> #include <list> #include <map> #include <set> #include <functional> #include <queue> #include <iostream> #include <string.h> #include <iomanip> #include <algorithm> #include <functional> #include <cstdint> #include <climits> #include <unordered_set> #include <sstream> #include <stack> using namespace std; typedef long long int ll; typedef pair<ll,ll> pii; typedef tuple<double,int,int> t3; using namespace std; vector<int> v; vector<int> l; void dfs(int left, int right) { if(right <= left) { return; } int middle = (right - left) / 2 + left; if(l[middle] < 0) { } v.push_back(l[middle]); l[middle] = -1; dfs(left, middle); dfs(middle+1, right); } void solve() { int k; cin >> k; for(int i = k+1;i>=1;i--) { v.push_back(i); } for(int i = k + 2;i <= (1 << k) - 1;i++) { l.push_back(i); } dfs(0, (int)l.size()); for(auto e : v) { cout << e << " "; } cout << endl; } int main() { solve(); return 0; }