#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


/*
  a b c d e f
  ->
  (00a 01a' 11a) (11b 01b' 00b) (00c 01c' 11c) (11d 01d' 00d) (00e 01e' 11e) (11f 01f' 00f) (10f' 10e' 10d' 10c' 10b' 10a')
  
  fix this
  assume |a| = |b| = 1
  hypercube {00,01,11,10} * {a,b}
  (00a 10a), (10b 11b 11a 01a 01b 00b)
*/

int main() {
  int N;
  for (; ~scanf("%d", &N); ) {
    int n;
    vector<int> es;
    vector<int> cs;
    if (N == 1) {
      n = 1;
      es = {0, 0};
      cs = {1};
    } else if (N % 2 == 0) {
      n = 2;
      es = {0, 1, 0, 1};
      cs = {1, 1};
    } else {
      n = 3;
      es = {0, 1, 0, 2, 0, 1, 0, 2};
      cs = {2, 1, 1};
    }
    for (; n < N; n += 2) {
      vector<int> ccs(n + 2);
      {
        const int quo = (1 << (n + 1)) / (n + 2);
        const int rem = (1 << (n + 1)) % (n + 2);
        for (int e = 0; e < n + 2; ++e) ccs[e] = quo + ((e < rem) ? 1 : 0);
        if (ccs[n] != ccs[n + 1]) reverse(ccs.begin(), ccs.end());
// cerr<<n<<" -> "<<n+2<<": "<<cs<<" -> "<<ccs<<endl;
        assert(ccs[n] == ccs[n + 1]);
      }
      for (int e = 0; e < n; ++e) cs[e] *= 4;
      for (const int i : {0, 1, 2}) assert(--cs[es[i]] >= ccs[es[i]]);
      int last = 2;
      int side = 0;
      vector<int> ees;
      ees.reserve(1 << (n + 2));
      for (int i = 3; i <= 1 << n; ++i) if (i == 1 << n || cs[es[i]] > ccs[es[i]]) {
// cerr<<"["<<last<<", "<<i<<")"<<endl;
        if (i < 1 << n) --cs[es[i]];
        // 00, 01, 11
        ees.push_back(es[last]);
        for (int j = last + 1; j < i; ++j) ees.push_back(es[j]);
        ees.push_back(n + side);
        for (int j = i; --j >= last + 1; ) ees.push_back(es[j]);
        ees.push_back(n + (side ^ 1));
        for (int j = last + 1; j < i; ++j) ees.push_back(es[j]);
        last = i;
        side ^= 1;
      }
      ees.push_back(es[0]);
      ees.push_back(n + 1);
      ees.push_back(es[0]);
      for (int j = 1 << n; --j >= 2; ) ees.push_back(es[j]);
      ees.push_back(n);
      ees.push_back(es[1]);
      ees.push_back(n + 1);
      ees.push_back(es[1]);
      ees.push_back(n);
// cerr<<"ees = "<<ees<<endl;
      assert((int)ees.size() == 1 << (n + 2));
      vector<int> cnt(n + 2, 0);
      for (int i = 0; i < 1 << (n + 2); ++i) ++cnt[ees[i]];
      for (int e = 0; e < n + 2; ++e) assert(cnt[e] == 2 * ccs[e]);
      cs.swap(ccs);
      es.swap(ees);
    }
    
    for (int i = 0; i < 1 << N; ++i) {
      if (i) putchar(' ');
      const int e = es[i] + 1;
      if (e >= 10) putchar('0' + (e / 10));
      putchar('0' + (e % 10));
    }
    puts("");
#ifdef LOCAL
vector<int>xs((1<<N)+1,0);
for(int i=0;i<1<<N;++i)xs[i+1]=xs[i]^1<<es[i];
assert(!xs[1<<N]);
vector<int>freq(1<<N,0);
for(int i=0;i<1<<N;++i)assert(++freq[xs[i]]==1);
#endif
  }
  return 0;
}