#include<bits/stdc++.h>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pii pair<int,int>
#define piii pair<int,pii>
#define mp make_pair
#define pb push_back  
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = INT_MAX;
const ll LLINF = LLONG_MAX;
const double eps = 1e-5;
const double PI = M_PI;  
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
  
#define DIV 1000000007
typedef vector<ll> Array;
typedef vector<Array> matrix;
typedef tuple<int,int,int> tiii;
#define mt make_tuple
ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if(n&1==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
int m;
bool t[1000000] = {};
void sol(int a,int b){
  if(a == b && !t[a]){cout << a << " "; return;}
  int mid = (a + b)/2;
  if(!t[mid]){
    t[mid] = 1;
    cout << mid << " ";
    sol(mid,m); sol(2,mid);
  }
  return;
}

int main(){
  int k; cin >> k;
  if( k == 2){cout << 1 << " "<< 2 << " " << 3 << endl; return 0;}
  m = pow(2,k,LLINF) - 1;
  sol(2,m);
  cout << 1;
  for(int i = 2; i <= m; i++)
    if(!t[i])
      cout << " " << i;
  cout << endl;
  return 0;
}