Problem: This is an interactive problem

You are given a grid n× n, where n is odd. Rows are enumerated from 1 to n from up to down, columns are enumerated from 1 to n from left to right. Cell, standing on the intersection of row x and column y, is denoted by (x, y).

Every cell contains 0 or 1. It is known that the top-left cell contains 1, and the bottom-right cell contains 0.

We want to know numbers in all cells of the grid. To do so we can ask the following questions: 

"? x_1 y_1 x_2 y_2", where 1 ≤ x_1 ≤ x_2 ≤ n, 1 ≤ y_1 ≤ y_2 ≤ n, and x_1 + y_1 + 2 ≤ x_2 + y_2. In other words, we output two different cells (x_1, y_1), (x_2, y_2) of the grid such that we can get from the first to the second by moving only to the right and down, and they aren't adjacent.

As a response to such question you will be told if there exists a path between (x_1, y_1) and (x_2, y_2), going only to the right or down, numbers in cells of which form a palindrome.

For example, paths, shown in green, are palindromic, so answer for "? 1 1 2 3" and "? 1 2 3 3" would be that there exists such path. However, there is no palindromic path between (1, 1) and (3, 1).

<image>

Determine all cells of the grid by asking not more than n^2 questions. It can be shown that the answer always exists.

Input

The first line contains odd integer (3 ≤ n < 50) — the side of the grid.

Interaction

You begin the interaction by reading n.

To ask a question about cells (x_1, y_1), (x_2, y_2), in a separate line output "? x_1 y_1 x_2 y_2".

Numbers in the query have to satisfy 1 ≤ x_1 ≤ x_2 ≤ n, 1 ≤ y_1 ≤ y_2 ≤ n, and x_1 + y_1 + 2 ≤ x_2 + y_2. Don't forget to 'flush', to get the answer.

In response, you will receive 1, if there exists a path going from (x_1, y_1) to (x_2, y_2) only to the right or down, numbers in cells of which form a palindrome, and 0 otherwise.

In case your query is invalid or you asked more than n^2 queries, program will print -1 and will finish interaction. You will receive Wrong answer verdict. Make sure to exit immediately to avoid getting other verdicts.

When you determine numbers in all cells, output "!".

Then output n lines, the i-th of which is a string of length n, corresponding to numbers in the i-th row of the grid.

After printing a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see documentation for other languages.



Hack Format

To hack, use the following format.

The first line should contain a single odd integer n (side of your grid).

The i-th of n following lines should contain a string of length n corresponding to the i-th row of the grid. Top left element of the grid has to be equal to 1, bottom right has to be equal to 0.

Example

Input


3
0
1
0
1
1
1
1

Output


? 1 1 1 3
? 1 1 2 3
? 2 1 2 3
? 3 1 3 3
? 2 2 3 3
? 1 2 3 2
? 1 2 3 3
!
100
001
000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct bipartite_union_find {
  vector<int> parent;
  vector<int> size;
  vector<bool> bipartite;
  vector<bool> edge_parity;
  int components = 0;
  bipartite_union_find(int n = 0) {
    if (n > 0) init(n);
  }
  void init(int n) {
    parent.resize(n + 1);
    size.assign(n + 1, 1);
    bipartite.assign(n + 1, true);
    edge_parity.assign(n + 1, false);
    components = n;
    for (int i = 0; i <= n; i++) parent[i] = i;
  }
  int find(int x) {
    if (x == parent[x]) return x;
    int root = find(parent[x]);
    edge_parity[x] = edge_parity[x] ^ edge_parity[parent[x]];
    return parent[x] = root;
  }
  bool query_component(int x, int y) { return find(x) == find(y); }
  bool query_parity(int x, int y) {
    int x_root = find(x);
    int y_root = find(y);
    assert(x_root == y_root);
    return edge_parity[x] ^ edge_parity[y];
  }
  pair<bool, bool> unite(int x, int y, bool different = true) {
    int x_root = find(x);
    int y_root = find(y);
    if (x_root == y_root) {
      bool consistent = !(edge_parity[x] ^ edge_parity[y] ^ different);
      if (!consistent) bipartite[x_root] = false;
      return {false, consistent};
    }
    bool needed_parity = edge_parity[x] ^ edge_parity[y] ^ different;
    x = x_root;
    y = y_root;
    if (size[x] < size[y]) swap(x, y);
    parent[y] = x;
    size[x] += size[y];
    bipartite[x] = bipartite[x] && bipartite[y];
    edge_parity[y] = needed_parity;
    components--;
    return {true, true};
  }
  pair<bool, bool> add_different_edge(int x, int y) {
    return unite(x, y, true);
  }
  pair<bool, bool> add_same_edge(int x, int y) { return unite(x, y, false); }
};
int N;
bipartite_union_find UF;
int query(int r1, int c1, int r2, int c2) {
  cout << "? " << r1 << ' ' << c1 << ' ' << r2 << ' ' << c2 << endl;
  int result;
  cin >> result;
  if (result < 0) exit(0);
  return result;
}
int convert(int r, int c) { return (r - 1) * N + (c - 1); }
void output() {
  cout << "!" << '\n';
  for (int r = 1; r <= N; r++) {
    for (int c = 1; c <= N; c++)
      cout << UF.query_parity(convert(r, c), convert(N, N));
    cout << '\n';
  }
  cout << flush;
  exit(0);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> N;
  UF.init(N * N);
  UF.unite(convert(1, 1), convert(N, N), true);
  for (int r = 1; r <= N; r++)
    for (int c = 1; c <= N; c++)
      if ((r + c) % 2 == 0 && r + c > 2 && r + c < 2 * N) {
        int prev_r = r - 2, prev_c = c;
        while (prev_r < 1) {
          prev_r++;
          prev_c--;
        }
        UF.unite(convert(prev_r, prev_c), convert(r, c),
                 !query(prev_r, prev_c, r, c));
      }
  UF.unite(convert(2, 1), convert(2, 3), !query(2, 1, 2, 3));
  for (int r = 1; r <= N; r++)
    for (int c = 1; c <= N; c++)
      if ((r + c) % 2 != 0 && r + c > 3) {
        int prev_r = r - 2, prev_c = c;
        while (prev_r < 1) {
          prev_r++;
          prev_c--;
        }
        UF.unite(convert(prev_r, prev_c), convert(r, c),
                 !query(prev_r, prev_c, r, c));
      }
  bool finished = false;
  for (int r = 2; r <= N && !finished; r++)
    for (int c = 1; c < N && !finished; c++)
      if (UF.query_parity(convert(r, c), convert(r - 1, c + 1))) {
        int start_r = r - 1, start_c = max(c - 1, 1);
        int end_r = start_r + 1, end_c = start_c + 2;
        UF.unite(convert(start_r, start_c), convert(end_r, end_c),
                 !query(start_r, start_c, end_r, end_c));
        finished = true;
        break;
      }
  if (finished) {
    output();
    return 0;
  }
  for (int r = 1; r < N && !finished; r++)
    for (int c = 1; c < N && !finished; c++) {
      bool first = UF.query_parity(convert(r, c), convert(r + 1, c + 1));
      if (r + 2 <= N) {
        bool second = UF.query_parity(convert(r + 1, c), convert(r + 2, c + 1));
        if (first == second) {
          UF.unite(convert(r, c), convert(r + 2, c + 1),
                   !query(r, c, r + 2, c + 1));
          finished = true;
          break;
        }
      }
      if (c + 2 <= N) {
        bool second = UF.query_parity(convert(r, c + 1), convert(r + 1, c + 2));
        if (first == second) {
          UF.unite(convert(r, c), convert(r + 1, c + 2),
                   !query(r, c, r + 1, c + 2));
          finished = true;
          break;
        }
      }
    }
  assert(finished);
  output();
}