#include "message.h"
#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

namespace {

constexpr int N = 1024;
constexpr int L = 31;
constexpr int P = 66;

int n;
bool occ[P][L];
vector<bool> pkg[P];

int to[L];
bool vis[L], ban[L];

}

void send_message (vector<bool> M, vector<bool> C) {
  n = sz(M);
  M.resize(N + 1);
  L (i, n + 1, N) {
    M[i] = true;
  }
  L (i, 0, P - 1) {
    pkg[i].assign(L, false);
    L (j, 0, L - 1) {
      occ[i][j] = false;
    }
  }
  L (i, 0, L - 1) if (!C[i]) {
    int p = (i + 1) % L, d = 1;
    while (C[p]) {
      p = (p + 1) % L;
      ++d;
    }
    L (j, 0, d - 1) {
      occ[j][i] = true;
      pkg[j][i] = (j == d - 1);
    }
  }
  int cur = 0;
  L (i, 0, L - 1) if (!C[i]) {
    L (j, 0, P - 1) {
      if (!occ[j][i]) {
        pkg[j][i] = M[cur++];
      }
    }
  }
  for (auto v : pkg) {
    send_packet(v);
  }
}

vector<bool> receive_message(vector<vector<bool>> R) {
  L (i, 0, L - 1) {
    L (j, 0, P - 1) {
      if (R[j][i]) {
        to[i] = (i + j + 1) % L;
        break;
      }
    }
  }
  vi path;
  L (i, 0, L - 1) {
    vis[i] = false;
  }
  L (s, 0, L - 1) {
    if (vis[s]) {
      continue;
    }
    path.clear();
    int x = s;
    while (!vis[x]) {
      vis[x] = true;
      path.eb(x);
      x = to[x];
    }
    int p = find(path.begin(), path.end(), x) - path.begin();
    if (sz(path) - p == 16) {
      L (i, 0, L - 1) {
        ban[i] = true;
      }
      L (i, p, sz(path) - 1) {
        ban[path[i]] = false;
      }
      break;
    }
  }
  L (i, 0, P - 1) {
    L (j, 0, L - 1) {
      occ[i][j] = false;
    }
  }
  L (i, 0, L - 1) if (!ban[i]) {
    int p = (i + 1) % L, d = 1;
    while (ban[p]) {
      p = (p + 1) % L;
      ++d;
    }
    L (j, 0, d - 1) {
      occ[j][i] = true;
    }
  }
  vector<bool> ans;
  L (i, 0, L - 1) if (!ban[i]) {
    L (j, 0, P - 1) {
      if (!occ[j][i]) {
        ans.eb(R[j][i]);
      }
    }
  }
  int l = N;
  while (ans[l]) {
    --l;
  }
  ans.resize(l);
  return ans;
}
// I love WHQ!