G

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <string.h>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <sstream>

#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define ALL(x) x.begin(), x.end()
#define F first
#define S second
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,-1,sizeof(x))
#define pw(x) (1ull<<(x))
#define bit(x, i) (((x)>>(i))&1)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
const int INF = 2147483647;
const ll LLINF = 9223372036854775807LL;

pii ans(int a, int b, int c) {
  pii res;
  int v1 = b^c;
  res.F = a^v1;
  int v2 = v1&a;
  int v3 = b&c;
  res.S = v2|v3;
  return res;
}

int main() {
  //freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  for (int mask=0;mask<pw(11);mask++) {
    int was = bit(mask, 10);
    for (int i=9;i>=1;i-=2) {
      pii res = ans(was, bit(mask,i), bit(mask, i-1));
      cout << res.F << " ";
      was = res.S;
    }
    cout << was << "\n";
  }
  return 0;
}