// compile: g++ -o data data.cpp -std=gnu++20 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#endif
#define sz(v) ((int)(v).size())
#define PV(v) for (int i=0;i<v.size();++i)cout<<v[i]<<" ";cout<<endl;
#define INTINF 9223372036854775807
#define int long long

using namespace std;

void fill_bit(vector<int> &a, int bit, int batch) {
    int m = a.size();
    int filled = batch >> 1;
    int x = 0;
    for (int i = 0; i < m; ++i) {
        if (filled++ == batch) x ^= 1, filled = 1;
        a[i] |= x << bit;
    }
}

void pb(int n, int x) {
    for (int i = n-1; i >= 0; --i) cout << (((x & (1 << i)) > 0) ? 1 : 0);
    cout << endl;
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n; cin >> n;
    int m = pow(2, n);
    vector<int> a(m);
    for (int i = 0; i < n; ++i) {
        int bit = n - i - 1;
        int batch = m >> i;
        fill_bit(a, bit, batch);
    }
    for (int i = 0; i < m; ++i) pb(n, a[i]);

    return 0;
}