#include <bits/stdc++.h>
using namespace std;
int n, val[60][60], ret, parity;
pair<int, int> change(int k) {
  if (k <= n)
    return make_pair(1, k);
  else
    return make_pair(k - n + 1, n);
}
int main() {
  scanf("%d", &n);
  val[1][1] = 1;
  val[n][n] = 0;
  for (int j = 3; j <= n; j++) {
    printf("? 1 %d 1 %d\n", j - 2, j);
    fflush(stdout);
    scanf("%d", &ret);
    if (ret == 1)
      val[1][j] = val[1][j - 2];
    else
      val[1][j] = 1 - val[1][j - 2];
  }
  for (int i = 3; i <= n; i += 2)
    for (int j = 1; j <= n; j += 2) {
      if (i == n && j == n) continue;
      printf("? %d %d %d %d\n", i - 2, j, i, j);
      fflush(stdout);
      scanf("%d", &ret);
      if (ret == 1)
        val[i][j] = val[i - 2][j];
      else
        val[i][j] = 1 - val[i - 2][j];
    }
  for (int i = 2; i < n; i += 2)
    for (int j = 2; j < n; j += 2) {
      printf("? %d %d %d %d\n", i - 1, j - 1, i, j);
      fflush(stdout);
      scanf("%d", &ret);
      if (ret == 1)
        val[i][j] = val[i - 1][j - 1];
      else
        val[i][j] = 1 - val[i - 1][j - 1];
    }
  for (int j = 3; j <= n; j += 2) {
    printf("? 1 %d 2 %d\n", j - 1, j);
    fflush(stdout);
    scanf("%d", &ret);
    if (ret == 1)
      val[2][j] = val[1][j - 1];
    else
      val[2][j] = 1 - val[1][j - 1];
  }
  for (int i = 3; i <= n; i++)
    for (int j = (i + 1) % 2 + 2; j <= n; j += 2) {
      printf("? %d %d %d %d\n", i - 2, j, i, j);
      fflush(stdout);
      scanf("%d", &ret);
      if (ret == 1)
        val[i][j] = val[i - 2][j];
      else
        val[i][j] = 1 - val[i - 2][j];
    }
  for (int i = 2; i <= n; i += 2) {
    printf("? %d 1 %d 2\n", i, i + 1);
    fflush(stdout);
    scanf("%d", &ret);
    if (ret == 1)
      val[i][1] = val[i + 1][2];
    else
      val[i][1] = 1 - val[i + 1][2];
  }
  int idx = 1;
  while (1) {
    if (val[change(idx).first][change(idx).second] ==
            val[change(idx + 3).first][change(idx + 3).second] &&
        val[change(idx + 1).first][change(idx + 1).second] ==
            val[change(idx + 2).first][change(idx + 2).second]) {
      printf("? %d %d %d %d\n", change(idx).first, change(idx).second,
             change(idx + 3).first, change(idx + 3).second);
      fflush(stdout);
      scanf("%d", &ret);
      if (ret == 1)
        parity = 0;
      else
        parity = 1;
      break;
    } else if (val[change(idx).first][change(idx).second] !=
                   val[change(idx + 3).first][change(idx + 3).second] &&
               val[change(idx + 1).first][change(idx + 1).second] !=
                   val[change(idx + 2).first][change(idx + 2).second]) {
      printf("? %d %d %d %d\n", change(idx).first, change(idx).second,
             change(idx + 3).first, change(idx + 3).second);
      fflush(stdout);
      scanf("%d", &ret);
      if (ret == 1)
        parity = 1;
      else
        parity = 0;
      break;
    }
    idx++;
  }
  printf("!\n");
  fflush(stdout);
  for (int i = 1; i <= n; i++, puts(""))
    for (int j = 1; j <= n; j++) {
      if ((i + j) % 2 == 0)
        printf("%d", val[i][j]);
      else
        printf("%d", (val[i][j] + parity) % 2);
    }
  fflush(stdout);
  return 0;
}
