#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void test_case() {
  long long n, m;
  cin >> n;
  vector<vector<long long> > adj(n + 2, vector<long long>(n + 2, 0));
  adj[1][1] = 1;
  adj[n][n] = 0;
  for (long long i = (3); i <= (n); i++) {
    cout << "? " << i - 2 << " " << 1 << " " << i << " " << 1 << endl;
    char c;
    cin >> c;
    adj[i][1] = c == '1' ? adj[i - 2][1] : (!adj[i - 2][1]);
  }
  cout << "? " << 2 << " " << 1 << " " << 2 << " " << 3 << endl;
  char c;
  cin >> c;
  adj[2][3] = c == '1' ? adj[2][1] : (!adj[2][1]);
  cout << "? " << 1 << " " << 2 << " " << 2 << " " << 3 << endl;
  cin >> c;
  adj[1][2] = c == '1' ? adj[2][3] : (!adj[2][3]);
  for (long long i = (1); i <= (n); i++) {
    if (i % 2) {
      if (i == 1) {
        continue;
      }
      cout << "? " << i - 2 << " " << 2 << " " << i << " " << 2 << endl;
      char c;
      cin >> c;
      adj[i][2] = c == '1' ? adj[i - 2][2] : (!adj[i - 2][2]);
    } else {
      cout << "? " << i - 1 << " " << 1 << " " << i << " " << 2 << endl;
      char c;
      cin >> c;
      adj[i][2] = c == '1' ? adj[i - 1][1] : (!adj[i - 1][1]);
    }
  }
  for (long long i = (1); i <= (n); i++) {
    for (long long j = (3); j <= (n); j++) {
      cout << "? " << i << " " << j - 2 << " " << i << " " << j << endl;
      char c;
      cin >> c;
      adj[i][j] = c == '1' ? adj[i][j - 2] : (!adj[i][j - 2]);
    }
  }
  bool done = true;
  for (long long i = (1); i <= (n - 2); i++) {
    if (adj[i][i] == adj[i + 1][i + 1] && adj[i][i] != adj[i + 2][i + 2]) {
      char d = '1';
      if (adj[i][i + 1] != adj[i + 1][i + 2]) d = '0';
      if (d == '1') {
        cout << "? " << i << " " << i << " " << i + 1 << " " << i + 2 << endl;
        char c;
        cin >> c;
        long long p = adj[i][i + 1];
        if (c == '1' && adj[i][i] != adj[i + 1][i + 2])
          done = false;
        else if (c == '0' && adj[i][i] == adj[i + 1][i + 2])
          done = false;
      } else {
        cout << "? " << i << " " << i + 1 << " " << i + 2 << " " << i + 2
             << endl;
        char c;
        cin >> c;
        long long p = adj[i][i + 1];
        if (c == '1' && adj[i][i + 1] != adj[i + 2][i + 2])
          done = false;
        else if (c == '0' && adj[i][i + 1] == adj[i + 2][i + 2])
          done = false;
      }
      break;
    } else if (adj[i][i] != adj[i + 1][i + 1] &&
               adj[i + 1][i + 1] == adj[i + 2][i + 2]) {
      char d = '1';
      if (adj[i][i + 1] != adj[i + 1][i + 2]) d = '0';
      if (d == '0') {
        cout << "? " << i << " " << i << " " << i + 1 << " " << i + 2 << endl;
        char c;
        cin >> c;
        if (c == '1' && adj[i][i] != adj[i + 1][i + 2])
          done = false;
        else if (c == '0' && adj[i][i] == adj[i + 1][i + 2])
          done = false;
      } else {
        cout << "? " << i << " " << i + 1 << " " << i + 2 << " " << i + 2
             << endl;
        char c;
        cin >> c;
        if (c == '1' && adj[i][i + 1] != adj[i + 2][i + 2])
          done = false;
        else if (c == '0' && adj[i][i + 1] == adj[i + 2][i + 2])
          done = false;
      }
      break;
    }
  }
  cout << '!' << endl;
  for (long long i = (1); i <= (n); i++) {
    for (long long j = (1); j <= (n); j++) {
      if ((i + j) % 2 && (!done))
        cout << !adj[i][j];
      else
        cout << adj[i][j];
    }
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long t = 1;
  while (t--) {
    test_case();
  }
  return 0;
}
