#include <bits/stdc++.h>
using namespace std;
const int N = 52;
int n;
int a[N][N];
int ask(int x1, int y1, int x2, int y2) {
  cout << "? " << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
  int resp;
  cin >> resp;
  return !resp;
}
int main() {
  cin >> n;
  a[1][1] = 1;
  for (int i = 1; i <= n; i += 2)
    for (int j = 1; j <= n; j += 2) {
      if (j == 1) {
        if (i == 1) continue;
        a[i][j] = a[i - 2][j] ^ ask(i - 2, j, i, j);
      } else
        a[i][j] = a[i][j - 2] ^ ask(i, j - 2, i, j);
    }
  for (int i = 2; i <= n; i += 2)
    for (int j = 2; j <= n; j += 2)
      a[i][j] = a[i - 1][j - 1] ^ ask(i - 1, j - 1, i, j);
  for (int i = 1; i <= n; i += 2)
    for (int j = 2; j <= n; j += 2) {
      if (j == 2) {
        if (i == 1) continue;
        a[i][j] = a[i - 2][j] ^ ask(i - 2, j, i, j);
      } else
        a[i][j] = a[i][j - 2] ^ ask(i, j - 2, i, j);
    }
  for (int i = 2; i <= n; i += 2)
    for (int j = 1; j <= n; j += 2) {
      if (j == 1) {
        if (i == 2)
          a[i][j] = a[i + 1][j + 1] ^ ask(i, j, i + 1, j + 1);
        else
          a[i][j] = a[i - 2][j] ^ ask(i - 2, j, i, j);
      } else
        a[i][j] = a[i][j - 2] ^ ask(i, j - 2, i, j);
    }
  bool invert = false;
  bool found = false;
  for (int i = 1; i + 1 <= n && !found; ++i)
    for (int j = 1; j + 1 <= n && !found; ++j)
      if ((i + j) % 2 == 0) {
        if (j + 2 <= n &&
            ((a[i][j] ^ a[i + 1][j + 2]) == (a[i][j + 1] ^ (a[i][j + 2])) ||
             (a[i][j] ^ a[i + 1][j + 2]) == (a[i][j + 1] ^ a[i + 1][j + 1]))) {
          invert = (!ask(i, j, i + 1, j + 2)) ^ (a[i][j] == a[i + 1][j + 2]);
          found = true;
        }
        if (i + 2 <= n &&
            ((a[i][j] ^ a[i + 2][j + 1]) == (a[i + 1][j] ^ (a[i + 2][j])) ||
             (a[i][j] ^ a[i + 2][j + 1]) == (a[i + 1][j] ^ a[i + 1][j + 1]))) {
          invert = (!ask(i, j, i + 2, j + 1)) ^ (a[i][j] == a[i + 2][j + 1]);
          found = true;
        }
      }
  cerr << 'f' << found << '\n';
  if (invert)
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= n; ++j)
        if ((i + j) % 2 == 1) a[i][j] ^= 1;
  cout << "!" << endl;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) cout << a[i][j];
    cout << endl;
  }
  return 0;
}
