#include <bits/stdc++.h>
using namespace std;
const int n = 100;
int a[110][110];
int fc[15];
int tmp[6][6], tot;
int fa[210];
int getfa(int v) {
  return v == fa[v] ? v : fa[v] = getfa(fa[v]);
}
int main() {
  ios::sync_with_stdio(false);
  for (int i = 1; i <= 5; ++i) {
    for (int j = i + 1; j <= 5; ++j) {
      tmp[i][j] = ++tot;
    }
  }
  tot = 0;
  for (int i = 1; i <= 5; ++i) {
    for (int j = i + 1; j <= 5; ++j) {
      for (int k = j + 1; k <= 5; ++k) {
        ++tot;
        cout << "? " << i << ' ' << j << ' ' << k << endl;
        int bs = 0;
        cin >> bs;
        fc[tot] = bs;
      }
    }
  }
  for (int mj = 0; mj < (1 << 10); ++mj) {
    int ls[11];
    for (int j = 1; j <= 10; ++j) ls[j] = (mj >> (j - 1)) & 1;
    tot = 0;
    for (int i = 1; i <= 5; ++i) {
      for (int j = i + 1; j <= 5; ++j) {
        for (int k = j + 1; k <= 5; ++k) {
          ++tot;
          if (ls[tmp[i][j]] + ls[tmp[i][k]] + ls[tmp[j][k]] != fc[tot]) goto nxt;
        }
      }
    }
    for (int i = 1; i <= 5; ++i) {
      for (int j = i + 1; j <= 5; ++j) {
        a[i][j] = ls[tmp[i][j]];
        a[j][i] = a[i][j];
      }
    }
    break;
    nxt:;
  }
  for (int i = 6; i <= n; ++i) {
    const int li = i, yi = i + i;
    static mt19937 mt(19260817 ^ 19491001);
    iota(fa + 1, fa + i * 2 + 1, 1);
    deque<int> p;
    for (int j = 1; j < i; ++j) p.emplace_back(j);
		shuffle(p.begin(), p.end(), mt);
    while (p.size() > 1) {
      int u = p[0], v = p[1];
      p.pop_front(), p.pop_front();
      cout << "? " << i << ' ' << u << ' ' << v << endl;
      int bs = 0;
      cin >> bs;
      bs -= a[u][v];
      switch (bs) {
        case 0: case 2: {
          fa[getfa(u)] = fa[getfa(v)] = getfa(bs ? yi : li);
          fa[getfa(u + i)] = fa[getfa(v + i)] = getfa(bs ? li : yi);
          break;
        }
        case 1: {
          fa[getfa(u)] = getfa(v + i);
          fa[getfa(v)] = getfa(u + i);
          p.emplace_back(u);
          break;
        }
      }
    }
    if (!p.empty()) {
			int u = p[0], v = 0, bs = 0;
			for (int j = 1; j < i; ++j) {
				if (j == u) continue;
				if (getfa(j) == getfa(u)) {
					v = j;
					cout << "? " << i << ' ' << u << ' ' << v << endl;
					cin >> bs;
					bs -= a[u][v];
					bs /= 2;
					goto js;
				}
				if (getfa(j + i) != getfa(u)) {
					v = j;
					break;
				}
			}
			cout << "? " << i << ' ' << u << ' ' << v << endl;
			cin >> bs;
			bs -= a[u][v] + (getfa(v) == getfa(yi));
			js:
			fa[getfa(u)] = getfa(i * (bs + 1));
			fa[getfa(u + i)] = getfa(i * (2 - bs));
		}
    for (int j = 1; j < i; ++j) {
      a[i][j] = a[j][i] = getfa(j) == getfa(yi);
    }
  }
  cout << "!" << endl;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      cout << a[i][j];
    }
    cout << endl;
  }
  return 0;
}