#include "doll.h"

// Skyqwq
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> void inline read(T &x) {
  x = 0; int f = 1; char s = getchar();
  while (s < '0' || s > '9') { if (s == '-') { f = -1; } s = getchar(); }
  while (s >= '0' && s <= '9') x = x * 10 + (s ^ 48), s = getchar();
  x *= f;
}

template <typename T> bool inline chkMin(T &x, T y) { return y < x ? x = y, 1 : 0; }
template <typename T> bool inline chkMax(T &x, T y) { return y > x ? x = y, 1 : 0; }

const int N = 2e5 + 5;

int a[N], X[N << 1], Y[N << 1], w[N << 1], C[N], ji[N << 1];

vector<int> g[N];

int idx, now;

#define ls X[p]
#define rs Y[p]

int nd[N];

set<PII> s;

void bd(int &p, int l, int r, int i, int x, bool fl) {
  if (fl) {
    p = 1;
    s.insert(mp(l, r));
    return;
  }
  if (l == r) {
    return;
  }
  if (!p) p = ++idx;
  int mid = (l + r) >> 1;
  if (x >> i & 1) {
    bd(ls, l, mid, i - 1, 0, 1);
    bd(rs, mid + 1, r, i - 1, x ^ (1 << i), 0);
  } else {
    bd(ls, l, mid, i - 1, x, 0);
    bd(rs, mid + 1, r, i - 1, 0, 0);
  }
}

bool go(int &p, int l, int r, int x) {
  if (s.count(mp(l, r))) return 0;
  if (l == r) {
    if (p) return 0;
    p = -x;
    return 1;
  }
  int mid = (l + r) >> 1;
  bool ok = 0;
  if (!w[p]) ok = go(ls, l, mid, x);
  else ok = go(rs, mid + 1, r, x);
  w[p] ^= 1;
  return ok;
}

void create_circuit(int m, std::vector<int> A) {
  int n = A.size();  
  if (n == 1) {
    vector<int> c(m + 1, 0);
    c[0] = A[0];
    c[A[0]] = 0;
    vector<int> x, y;
    answer(c, x, y); 
    return;
  }
  for (int i = 0; i < n; i++) a[i + 1] = A[i];
  C[0] = a[1];
  int l = 1, o = 0;
  while (l < n) l <<= 1, o++;
  now = ++idx;
  nd[0] = 1;

  int dl = l - n;
  int xy = 0;
  for (int i = 0; i < o; i++) 
    if (dl >> i & 1) xy = i;

  // for (int i = 1; i <= xy; i++) {
  //   nd[i] = ++idx;
  //   X[idx] = nd[i - 1];
  //   Y[idx] = nd[i - 1];
  // }


  
  bd(now, 1, l, o - 1, dl, 0);
  for (int i = 1; i <= m; i++) C[i] = -1;
  int pa = 0;
  for (int i = 1; i <= n; i++) {
    while (1) {
      int o = go(now, 1, l, a[i + 1]);
      pa++;
      if (o) break;
    }
  }
  bool ok = 1;
  for (int i = 1; i <= idx; i++) if (w[i]) {
    ok = 0;
  }
  assert(ok);
  vector<int> x(idx, 0), y(idx, 0);
  for (int i = 0; i < idx; i++)
    x[i] = -X[i + 1], y[i] = -Y[i + 1];//, cerr << x[i] << " " << y[i] << endl;
  vector<int> c(m + 1, 0);
  for (int i = 0; i <= m; i++) c[i] = C[i];//, cerr << c[i] << " "; puts("");
  answer(c, x, y);
  
}