#include<bits/stdc++.h>
#include<bits/extc++.h>
#define int long long
#define inf 0x3f3f3f3f3f3f3f3f
#define maxn 1234567
#define eps 1e-7
#define mod 1000000007
#define Mod 998244353
#define f(i,a,b) for(int i=a;i<=b;i++)
#define r(i,a,b) for(int i=a;i>=b;i--) 
#define fx(i,a,b,x) for(int i=a;i<=b;i+=x)
#define rx(i,a,b,x) for(int i=a;i>=b;i-=x) 
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
int T;
int n;
int qpow(int a,int n,int m){
	int ans=1;
	while(n){
		if(n&1)ans=ans*a%m;
		a=a*a%m;
		n>>=1;
	}
	return ans;
}
void solve(){
	scanf("%lld",&n);
	printf("%lld ",qpow(2,n,inf)-1);
	f(i,0,n-1)
		fx(j,qpow(2,n-i-1,inf),qpow(2,n,inf)-2,qpow(2,n-i,inf))printf("%lld ",j);
}
signed main(){
	T=1;
//	scanf("%lld",&T);
	while(T--)solve();
	return 0;
}