#include <bits/stdc++.h>
using namespace std;
int n;
int a[53][53], b[53][53];
int ask(int x1, int y1, int x2, int y2) {
  cout << "? " << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
  int resp;
  cin >> resp;
  if (resp == -1) exit(0);
  return resp;
}
void out_a() {
  cout << '!' << '\n';
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cout << a[i][j];
    }
    cout << '\n';
  }
  exit(0);
}
void out_b() {
  cout << '!' << '\n';
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cout << b[i][j];
    }
    cout << '\n';
  }
  exit(0);
}
inline bool in(int i, int j) { return i >= 1 && i <= n && j >= 1 && j <= n; }
inline bool in2(int i, int j) { return i >= 1 && i <= n && j >= 2 && j <= n; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  a[1][1] = b[1][1] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if ((i - j) & 1) continue;
      if (i == 1 && j == 1) continue;
      if (i == n && j == n) continue;
      int pi = -1, pj = -1;
      if (in(i - 2, j))
        pi = i - 2, pj = j;
      else if (in(i, j - 2))
        pi = i, pj = j - 2;
      else if (in(i - 1, j - 1))
        pi = i - 1, pj = j - 1;
      else
        assert(0);
      a[i][j] = b[i][j] = (ask(pi, pj, i, j) == a[pi][pj]);
    }
  }
  a[1][2] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 2; j <= n; j++) {
      if (!((i - j) & 1)) continue;
      if (i == 1 && j == 2) continue;
      int pi = -1, pj = -1;
      if (in2(i - 2, j))
        pi = i - 2, pj = j;
      else if (in2(i, j - 2))
        pi = i, pj = j - 2;
      else if (in2(i - 1, j - 1))
        pi = i - 1, pj = j - 1;
      else
        assert(0);
      int resp = ask(pi, pj, i, j);
      a[i][j] = (resp == a[pi][pj]);
      b[i][j] = (resp == b[pi][pj]);
    }
  }
  for (int i = 2; i <= n; i += 2) {
    int resp = ask(i, 1, i + 1, 2);
    a[i][1] = (resp == a[i + 1][2]);
    b[i][1] = (resp == b[i + 1][2]);
  }
  for (int i = 2; i <= n - 1; i++) {
    if ((a[i][i - 1] ^ a[i + 1][i]) == (a[i - 1][i - 1] ^ a[i][i])) {
      if (ask(i - 1, i - 1, i + 1, i)) {
        if (a[i - 1][i - 1] == a[i + 1][i])
          out_a();
        else
          out_b();
      } else {
        if (a[i - 1][i - 1] != a[i + 1][i])
          out_a();
        else
          out_b();
      }
    } else if ((a[i][i - 1] ^ a[i + 1][i]) == (a[i][i] ^ a[i + 1][i + 1])) {
      if (ask(i, i - 1, i + 1, i + 1)) {
        if (a[i][i - 1] == a[i + 1][i + 1])
          out_a();
        else
          out_b();
      } else {
        if (a[i][i - 1] != a[i + 1][i + 1])
          out_a();
        else
          out_b();
      }
    }
  }
  return 0;
}
