#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool setmin(T &a, T b) {
  if (a > b) return a = b, 1;
  return 0;
}
template <class T>
inline bool setmax(T &a, T b) {
  if (a < b) return a = b, 1;
  return 0;
}
template <class T>
inline T fast(T a, T b, T mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
template <class T>
inline T russian(T a, T b, T mod) {
  long long res = 0;
  while (b) {
    if (b & 1) res = (res + a) % mod;
    a = (a + a) % mod;
    b >>= 1;
  }
  return res;
}
template <class T>
inline T sub(T a, T b, T mod) {
  return ((a % mod - b % mod) + mod) % mod;
}
template <class T>
inline T add(T a, T b, T mod) {
  return (a % mod + b % mod) % mod;
}
template <class T>
inline T mult(T a, T b, T mod) {
  return ((a % mod * b % mod) + mod) % mod;
}
template <class T>
inline T mult(vector<T> vec, T mod) {
  T ret = 1;
  for (int i = 0; i < (int)(vec).size(); i++) ret = (ret * vec[i]) % mod;
  return ret;
}
template <class T>
istream &operator>>(istream &os, vector<T> &container) {
  for (auto &u : container) os >> u;
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &container) {
  for (auto &u : container) os << u << " ";
  return os;
}
template <typename T>
inline T gcd(T a, T b) {
  while (b) swap(a %= b, b);
  return a;
}
long double PI = acosl(-1);
long double eps = 1e-11;
const long long T = 1 << 17;
const long long INF = 1e9 + 7;
const long long mod = 998244353;
const long long BIG_INF = 1e18 + 7;
const long long N = 2e5 + 7;
long long n, m, k;
int grid[51][51];
int grid2[51][51];
void ask(int a, int b, int c, int d) {
  cout << "? " << a << ' ' << b << ' ' << c << ' ' << d << endl;
  int temp;
  cin >> temp;
  if (temp) {
    grid[c][d] = grid[a][b];
    grid2[c][d] = grid2[a][b];
  } else {
    grid[c][d] = grid[a][b] ^ 1;
    grid2[c][d] = grid2[a][b] ^ 1;
  }
}
bool good_grid(int i, int j) {
  return grid[i][j] == grid[i + 1][j + 2] &&
         (grid[i][j + 1] == grid[i][j + 2] ||
          grid[i + 1][j] == grid[i + 1][j + 1]);
}
bool good_grid2(int i, int j) {
  return grid2[i][j] == grid2[i + 1][j + 2] &&
         (grid2[i][j + 1] == grid2[i][j + 2] ||
          grid2[i + 1][j] == grid2[i + 1][j + 1]);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  grid[1][1] = 1;
  grid2[1][1] = 1;
  grid[1][2] = 0;
  grid2[1][2] = 1;
  ask(1, 2, 2, 3);
  for (int i = 3; i <= n; i += 2) ask(1, i - 2, 1, i);
  for (int i = 3; i <= n; i += 2)
    for (int j = 1; j <= n; j += 2) ask(i - 2, j, i, j);
  for (int i = 2; i <= n; i += 2)
    for (int j = 2; j <= n; j += 2) ask(i - 1, j - 1, i, j);
  for (int i = 4; i <= n; i += 2) ask(1, i - 2, 1, i);
  for (int i = 4; i <= n; i += 2) ask(i - 2, 3, i, 3);
  for (int i = 2; i <= n; i += 2) {
    cout << "? " << i << ' ' << 1 << ' ' << i << ' ' << 3 << endl;
    int temp;
    cin >> temp;
    if (temp) {
      grid[i][1] = grid[i][3];
      grid2[i][1] = grid2[i][3];
    } else {
      grid[i][1] = grid[i][3] ^ 1;
      grid2[i][1] = grid2[i][3] ^ 1;
    }
  }
  for (int i = 2; i <= n; i += 2)
    for (int j = 5; j <= n; j += 2) ask(i, j - 2, i, j);
  for (int i = 3; i <= n; i += 2)
    for (int j = 2; j <= n; j += 2) ask(i - 2, j, i, j);
  for (int i = 1; i < n; i++)
    for (int j = 1; j < n - 1; j++)
      if (good_grid(i, j) != good_grid2(i, j)) {
        cout << "? " << i << ' ' << j << ' ' << i + 1 << ' ' << j + 2 << endl;
        int temp;
        cin >> temp;
        cout << "!" << endl;
        if (good_grid(i, j) == temp)
          for (int I = 1; I <= n; I++) {
            for (int J = 1; J <= n; J++) cout << grid[I][J];
            cout << endl;
          }
        else
          for (int I = 1; I <= n; I++) {
            for (int J = 1; J <= n; J++) cout << grid2[I][J];
            cout << endl;
          }
        exit(0);
      }
}
