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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF INT_MAX/3

ll k;
ll cnt=1;
ll res[101010];

void dfs(ll v){
  if(v>=pow(2,k)-1)return;
  dfs(v*2+1);
  res[v]=cnt++;
  dfs(v*2+2);
}

int main(){
	cin.sync_with_stdio(false);
  cin>>k;
  dfs(0);
  vector<ll> tmp;
  sort(res+cnt-1-(ll)pow(2,k-1)-1,res+cnt-1);
  rep(i,cnt-1)printf("%lld ", res[i]);
  printf("\n");
	return 0;
}