#include <bits/stdc++.h>

using namespace std;

vector<int> ans;

void solve(int l, int r) {
  int m = (l+r)/2;
  ans.push_back(m);
  if(l == m || r == m) return;
  solve(l, m-1);
  solve(m+1, r);
}

int main() {
  int K;
  cin >> K;
  ans.push_back(1<<(K-1));
  solve(1, (1<<(K-1))-1);
  solve((1<<(K-1))+1, (1<<K)-1);
  swap(ans[ans.size()-3], ans[ans.size()-1]);
  for(int i = 0; i < (int)ans.size(); i++) {
    if(i) cout << " ";
    cout << ans[i];
  }
  cout << endl;
  return 0;
}