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

vector<int> v;

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

int main() {
  int k;
  cin>>k;
  int n = (1<<k) - 1;
  int root = (1<<k)/2-1;
  v.push_back(root);

  solve(1, root);
  solve(root+1, n + 1);
  for (int i=0; i<n; i++) {
    cout<<v[i];
    if (i != n - 1) {
      cout<<" ";
    }
  }
  cout<<endl;
}