// Author: Klay Thompson
// Problem: P10831 [COTS/CETS 2023] 三角形 Trokuti
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P10831
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 110;
mt19937 rnd(random_device{}());

int n = 100, cnt = 0, a[maxn][maxn], b[maxn][maxn], p[maxn];

int ask(int x, int y, int z) {
  cnt++;
  assert(x >= 1 && x <= n && y >= 1 && y <= n && z >= 1 && z <= n);
  assert(x != y && y != z && z != x);
  // return b[x][y] + b[y][z] + b[z][x];
  cout << "? " << x << " " << y << " " << z << endl;
  return cin >> x, x;
}

int main() {
  // rep (i, 1, n) rep (j, i + 1, n) b[i][j] = b[j][i] = (rnd() & 1);
  string res = ""s;
  rep (i, 1, 5) rep (j, i + 1, 5) rep (k, j + 1, 5) res += to_string(ask(i, j, k));
  rep (S, 0, (1 << 10) - 1) {
    int msk = S;
    rep (i, 1, 5) rep (j, i + 1, 5) a[i][j] = a[j][i] = (msk & 1), msk >>= 1;
    string cur = ""s;
    rep (i, 1, 5) rep (j, i + 1, 5) rep (k, j + 1, 5) cur += to_string(a[i][j] + a[j][k] + a[k][i]);
    if (cur == res) break;
  }
  // rep (i, 1, 5) rep (j, 1, 5) assert(a[i][j] == b[i][j]);
  rep (i, 1, n) p[i] = i;
  rep (i, 6, n) {
    shuffle(p + 1, p + i, rnd);
    int pos = 1, lst = 0;
    while (pos < i - 1) {
      int w = ask(p[pos], p[pos + 1], i) - a[p[pos]][p[pos + 1]];
      if (w == 0 || w == 2) {
        int val = w >> 1;
        a[i][p[pos]] = a[i][p[pos + 1]] = a[p[pos]][i] = a[p[pos + 1]][i] = val;
        per (j, pos - 1, lst + 1) val ^= 1, a[i][p[j]] = a[p[j]][i] = val;
        lst = pos + 1, pos += 2;
      } else {
        pos += 1;
      }
    }
    // 交替段 [lst + 1, pos - 1]
    if (lst + 1 <= pos - 1) {
      if (lst == 0) {
        int w = ask(p[1], p[3], i) - a[p[1]][p[3]];
        int val = w >> 1;
        rep (j, 1, pos - 1) a[i][p[j]] = a[p[j]][i] = val, val ^= 1;
      } else {
        int w = ask(p[1], p[lst + 1], i) - a[p[1]][p[lst + 1]] - a[p[1]][i];
        rep (j, lst + 1, pos - 1) a[i][p[j]] = a[p[j]][i] = w, w ^= 1;
      }
    }
    if (pos == i - 1) {
      a[i][p[i - 1]] = a[p[i - 1]][i] = ask(p[1], p[i - 1], i) - a[p[1]][p[i - 1]] - a[p[1]][i];
    }
  }
  // rep (i, 1, n) rep (j, 1, n) if (a[i][j] != b[i][j]) {
    // cout << i << ", " << j << ": expected " << b[i][j] << " but " << a[i][j] << '\n';
  // }
  // cerr << "used " << cnt << " queries.\n";
  cout << "!" << endl;
  rep (i, 1, n) {
    rep (j, 1, n) cout << a[i][j];
    cout << endl;
  }
}