#include <bits/stdc++.h>
using namespace std;
template <class T>
using rque = priority_queue<T, vector<T>, greater<T>>;
const long long mod = 998244353;
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmax(T &a, const T &b) {
  if (b > a) {
    a = b;
    return 1;
  }
  return 0;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  if (b == 0) return a;
  long long c = a % b;
  while (c != 0) {
    a = b;
    b = c;
    c = a % b;
  }
  return b;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = extGCD(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
struct UnionFind {
  vector<long long> data;
  int num;
  UnionFind(int sz) {
    data.assign(sz, -1);
    num = sz;
  }
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return (false);
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    num--;
    return (true);
  }
  int find(int k) {
    if (data[k] < 0) return (k);
    return (data[k] = find(data[k]));
  }
  long long size(int k) { return (-data[find(k)]); }
};
long long M = 1000000007;
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
using mint = ModInt<mod>;
mint mpow(mint x, long long n) {
  mint ans = 1;
  while (n != 0) {
    if (n & 1) ans *= x;
    x *= x;
    n = n >> 1;
  }
  return ans;
}
long long mpow2(long long x, long long n, long long mod) {
  long long ans = 1;
  while (n != 0) {
    if (n & 1) ans = ans * x % mod;
    x = x * x % mod;
    n = n >> 1;
  }
  return ans;
}
vector<mint> fac;
vector<mint> ifac;
void setcomb(int sz = 2000010) {
  fac.assign(sz + 1, 0);
  ifac.assign(sz + 1, 0);
  fac[0] = 1;
  for (long long i = 0; i < sz; i++) {
    fac[i + 1] = fac[i] * (i + 1);
  }
  ifac[sz] = fac[sz].inverse();
  for (long long i = sz; i > 0; i--) {
    ifac[i - 1] = ifac[i] * i;
  }
}
mint comb(long long a, long long b) {
  if (fac.size() == 0) setcomb();
  if (a == 0 && b == 0) return 1;
  if (a < b || a < 0) return 0;
  return ifac[a - b] * ifac[b] * fac[a];
}
mint perm(long long a, long long b) {
  if (fac.size() == 0) setcomb();
  if (a == 0 && b == 0) return 1;
  if (a < b || a < 0) return 0;
  return fac[a] * ifac[a - b];
}
long long modinv(long long a) {
  long long b = M, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= M;
  if (u < 0) u += M;
  return u;
}
long long modinv2(long long a, long long mod) {
  long long b = mod, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= mod;
  if (u < 0) u += mod;
  return u;
}
void query(long long x1, long long y1, long long x2, long long y2) {
  cout << "? " << x1 + 1 << " " << y1 + 1 << " " << x2 + 1 << " " << y2 + 1
       << endl;
}
int main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  long long n;
  cin >> n;
  long long ans[n + 2][n + 2];
  long long res;
  for (long long i = 0; i < (n + 2); i++)
    for (long long j = 0; j < (n + 2); j++) ans[i][j] = -1;
  ans[0][0] = 1;
  ans[n - 1][n - 1] = 0;
  ans[0][1] = 1;
  for (long long i = 0; i < (n); i++)
    for (long long j = 0; j < (n); j++) {
      if (ans[i][j] == -1) {
        if (ans[i + 2][j] != -1) {
          query(i, j, i + 2, j);
          cin >> res;
          if (res == -1) return 0;
          ans[i][j] = ans[i + 2][j] ^ res ^ 1;
        } else if (ans[i][j + 2] != -1) {
          query(i, j, i, j + 2);
          cin >> res;
          if (res == -1) return 0;
          ans[i][j] = ans[i][j + 2] ^ res ^ 1;
        } else if (ans[i + 1][j + 1] != -1) {
          query(i, j, i + 1, j + 1);
          cin >> res;
          if (res == -1) return 0;
          ans[i][j] = ans[i + 1][j + 1] ^ res ^ 1;
        }
      }
      if (ans[i + 2][j] == -1 && i + 2 < n) {
        query(i, j, i + 2, j);
        cin >> res;
        if (res == -1) return 0;
        ans[i + 2][j] = ans[i][j] ^ res ^ 1;
      }
      if (ans[i][j + 2] == -1 && j + 2 < n) {
        query(i, j, i, j + 2);
        cin >> res;
        if (res == -1) return 0;
        ans[i][j + 2] = ans[i][j] ^ res ^ 1;
      }
      if (ans[i + 1][j + 1] == -1 && i + 1 < n && j + 1 < n) {
        query(i, j, i + 1, j + 1);
        cin >> res;
        if (res == -1) return 0;
        ans[i + 1][j + 1] = ans[i][j] ^ res ^ 1;
      }
    }
  int flag = 0, flip = 0;
  for (long long i = 0; i < (n - 1); i++)
    for (long long j = 0; j < (n - 1); j++) {
      if (!flag) {
        if (i + 2 < n) {
          if (ans[i][j] == ans[i + 2][j + 1]) {
            if (ans[i + 1][j] == ans[i + 2][j] &&
                ans[i][j + 1] == ans[i + 1][j + 1]) {
              query(i, j, i + 2, j + 1);
              cin >> res;
              if (res == -1) return 0;
              flip = res ^ 1;
              flag = 1;
              break;
            }
          } else {
            if (ans[i + 1][j] != ans[i + 2][j] &&
                ans[i][j + 1] != ans[i + 1][j + 1]) {
              query(i, j, i + 2, j + 1);
              cin >> res;
              if (res == -1) return 0;
              flip = res;
              flag = 1;
              break;
            }
          }
        }
        if (j + 2 < n) {
          if (ans[i][j] == ans[i + 1][j + 2]) {
            if (ans[i][j + 1] == ans[i][j + 2] &&
                ans[i + 1][j] == ans[i + 1][j + 1]) {
              query(i, j, i + 1, j + 2);
              cin >> res;
              if (res == -1) return 0;
              flip = res ^ 1;
              flag = 1;
              break;
            }
          } else {
            if (ans[i][j + 1] != ans[i][j + 2] &&
                ans[i + 1][j] != ans[i + 1][j + 1]) {
              query(i, j, i + 1, j + 2);
              cin >> res;
              if (res == -1) return 0;
              flip = res;
              flag = 1;
              break;
            }
          }
        }
      }
    }
  for (long long i = 0; i < (n); i++)
    for (long long j = 0; j < (n); j++)
      if ((i + j) % 2 && flip) ans[i][j] ^= 1;
  cout << "!" << endl;
  for (long long i = 0; i < (n); i++) {
    for (long long j = 0; j < (n); j++) cout << ans[i][j];
    cout << endl;
  }
}
