#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> ans;
void dfs(int v,int k){
  //cout<<v<<" "<<k<<endl;
  ans.push_back(v);
  if(v&1) return;
  dfs(v-k/2,k/2);
  dfs(v+k/2,k/2);
}
signed main(){
  int k;
  cin>>k;
  int n=(1<<k)-1;
  dfs(1<<(k-1),1<<(k-1));
  swap(ans[n-3],ans[n-2]);
  for(int i=0;i<n;i++){
    if(i) cout<<" ";
    cout<<ans[i];
  }
  cout<<endl;
  return 0;
}