#include <bits/stdc++.h>

typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;

// TAGS
#define nl '\n'
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound

// Generic
#define fi first
#define se second

#define all(v) v.begin(),v.end() // inicio - fin
#define rall(v) v.rbegin(),v.rend() // fin - inicio

// CodeForces Optional
#define YES cout << "YES" << nl;
#define NO  cout << "NO"  << nl;
#define YESNO(x) cout << ((x)? "YES" : "NO") << nl;
#define jmp cout << nl;
#define fix cout << fixed << setprecision(15);

#define ii pair<int,int> // 2
#define iii pair<ii,int> // 3
#define iiii pair<ii,ii> // 4

// Debuging
#define qwer 					cerr << "----------------------" << endl;
#define debugList(A)          	if(debug) { cerr << "? " << #A << ": "; if(debug) { bool band = 0; cerr << "[ ";  for(auto x : A) { if(!band) cerr << x , band = 1; else cerr << " , " << x ;} cerr << " ]" << endl; } }
#define debugVar(A)           	if(debug) { cerr << "? " << #A << " : " << A << endl; }
#define debugPair(a,b)          if(debug) { cerr << "?? " << #a << " : " << a << " | " << #b << " : " << b << endl; }
#define printList(A) 		    bool band = 0; for(auto x : A) { if(!band) {cout << x; band = 1;}else {cout << " " << x;}} cout << endl;
#define debugIterablePairs(P) 	if(debug) { qwer cerr << "? " << #P << " : "; cerr << "{ " << endl; for(auto it : P) { cerr << "    " << it.first << " -> " << it.second << endl; } cerr << "} " << endl; qwer }
#define debugGraph(GP)          if(debug) { cerr << "? " << #GP << " = "; cerr << "{ " << endl; int cntNodes = 0; for(vi adj : GP) { if(adj.size()) { cerr << "   "; cerr << cntNodes << " => "; debugList(adj) } cntNodes ++;} cerr << "}" << endl;}
#define debugGraphWeight(GP) 	if(debug) { qwer cerr << "? " << #GP << " = {" << endl; int cntNodes = 0; for(auto it : GP ){ if( it.size() ){ cerr << cntNodes << " => [ "; for(auto iter : it){ cerr << iter.fi << "-w{" << iter.se << "} "; } cerr << "]" << endl; } cntNodes++; } qwer }
#define executeTime         	cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";

#define FOR(i,a,b) for(int i=a ; i<b ; i++)
#define mem(v,x) memset(v, (x), sizeof(v))
#define sz(a) (int) a.size()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())

typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;

// Const
const int    N    = 2e5  + 9;
const int    mod  = 1e9  + 7;
const int    inf  = 2e9  + 9;
const ll     modL = 1e9  + 7;
const ll     infL = 2e18 + 9;
const double pi   = acos(-1);

void init();
bool debug = { 0 };

void solve() {
    int n;
    cin >> n;
    int index = 0;
    FOR(i,0,n) {
        index += ( 1 << (n - i) );
        cout << index << " ";
    }
}

int main(){
	//init();
	cin.tie(0); ios_base::sync_with_stdio(0);
	int N = 1;
	//cin >> N;
	while(N--) solve();
	//executeTime;
	return 0;
}

void init(){
    //#ifndef ONLINE_JUDGE
	//	freopen("input.txt","r",stdin);
	//	freopen("output.txt","w",stdout);
	//	freopen("error.txt","w",stderr);
	// #endif
	cerr << "Mood Try Winner ALL\n";
	cerr << "Never Ctrl + C - Ctrl + V\n";
}