#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

ll n;

vector<ll> dfs(ll v, ll depth = 0, vector<ll> leaf = vector<ll>(0)) {
    vector<ll> ans;
    ans.push_back(v);
    for(auto x : leaf) ans.push_back(x);
    for(auto x : leaf) ans.push_back(x + v);
    if (depth == n) return ans;
    return dfs(v * 2, depth + 1, ans);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    cin >> n;
    vector<ll> ans = dfs(1);
    rep(i, sz(ans)) printf("%lld%s", ans[i], (i == (sz(ans) - 1)) ? "\n" : " ");
    return 0;
}