#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll K;

int main(void) {
  cin >> K;

  ll s = (1LL << K);
  ll p = s / 2, q = s;
  vector<ll> ans;
  while(p > 0) {
    for(ll i = p; i < s; i += q) {
      if(i <= s / 2) ans.push_back(i + 1);
      else if(i >= s / 2 + 2) ans.push_back(i);
      if(i == 1) ans.push_back(1);
    }
    p /= 2, q /= 2;
  }

  REP(i, 0, ans.size()) cout << ans[i] << (i + 1 != ans.size() ? " " : "\n");
}