#include <bits/stdc++.h>
using namespace std;
int n, dp[2][60][60], q[60][60][60][60];
int ask(int a, int b, int c, int d) {
  if (q[a][b][c][d] != -1) return q[a][b][c][d];
  cout << "? " << a << " " << b << " " << c << " " << d << endl;
  cout.flush();
  int x;
  cin >> x;
  if (x == -1) exit(0);
  x = 1 ^ x;
  q[a][b][c][d] = x;
  return x;
}
void print(int v) {
  cout << "!\n";
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) cout << dp[v][i][j];
    cout << endl;
  }
}
int main() {
  memset(q, -1, sizeof(q));
  cin >> n;
  for (int p = 0; p < 2; p++) {
    memset(dp[p], -1, sizeof(dp[p]));
    dp[p][1][1] = 1;
    dp[p][n][n] = 0;
    dp[p][1][2] = p;
    dp[p][2][3] = dp[p][1][2] ^ ask(1, 2, 2, 3);
    dp[p][3][2] = dp[p][1][2] ^ ask(1, 2, 3, 2);
    dp[p][2][1] = dp[p][3][2] ^ ask(2, 1, 3, 2);
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        if (dp[p][i][j] == -1) {
          if (i > 2)
            dp[p][i][j] = dp[p][i - 2][j] ^ ask(i - 2, j, i, j);
          else if (j > 2)
            dp[p][i][j] = dp[p][i][j - 2] ^ ask(i, j - 2, i, j);
          else
            dp[p][i][j] = dp[p][i - 1][j - 1] ^ ask(i - 1, j - 1, i, j);
        }
      }
    }
  }
  for (int p = 0; p < 2; p++) {
    for (int i = 3; i <= n; i++) {
      for (int j = 2; j <= n; j++) {
        if (dp[p][i - 2][j - 1] == dp[p][i][j]) {
          if (dp[p][i - 1][j - 1] == dp[p][i][j - 1] ||
              dp[p][i - 2][j] == dp[p][i - 1][j]) {
            if (ask(i - 2, j - 1, i, j))
              print(1 ^ p);
            else
              print(p);
            return 0;
          }
        }
      }
    }
    for (int i = 2; i <= n; i++) {
      for (int j = 3; j <= n; j++) {
        if (dp[p][i - 1][j - 2] == dp[p][i][j]) {
          if (dp[p][i - 1][j - 1] == dp[p][i - 1][j] ||
              dp[p][i][j - 2] == dp[p][i][j - 1]) {
            if (ask(i - 1, j - 2, i, j))
              print(1 ^ p);
            else
              print(p);
            return 0;
          }
        }
      }
    }
  }
}
