Problem: It is an interactive problem.

Vasya enjoys solving quizzes. He found a strange device and wants to know how it works.

This device encrypted with the tree (connected undirected graph without cycles) with n vertices, numbered with integers from 1 to n. To solve this quiz you should guess this tree.

Fortunately, this device can make one operation, using which you should guess the cipher. You can give the device an array d_1, d_2, …, d_n of non-negative integers. On the device, there are n lamps, i-th of them is connected with i-th vertex of the tree. For all i the light will turn on the i-th lamp, if there exist such vertex of the tree with number j ≠ i that dist(i, j) ≤ d_j. Let's define dist(i, j) as the distance between vertices i and j in tree or number of edges on the simple path between vertices i and j.

Vasya wants to solve this quiz using ≤ 80 operations with the device and guess the tree. Help him! 

Interaction

In the beginning, your program should read one integer n — the number of vertices of the tree which encrypts the device (2 ≤ n ≤ 1000).

After that, you can make several operations in the following format. To do operation print a symbol"?" (without quotes) and n integers d_1, d_2, …, d_n, separated by spaces after it. Please note, that for all i you can only use the numbers, satisfying the inequality 0 ≤ d_i < n. After that, you should read a string s with length n, consisting of symbols "0" and "1" (without quotes). For all i the symbol s_i is equal to "0", if the lamp on the device, connected with i-th vertex of the tree is switched off and "1" otherwise.

After several operations, you should print guessed tree. To do it print the only symbol "!" (without quotes). In the next n-1 lines print 2 integers a_i, b_i — indexes of the vertices connected by i-th edge of the tree. This numbers should satisfy the conditions 1 ≤ a_i, b_i ≤ n and a_i ≠ b_i. This edges should form a tree, which is equal to the hidden tree. After that, your program should terminate.

It is guaranteed, that in each test the tree is fixed before and won't change depending on your program's operations.

Your program can make from 0 to 80 operations with the device and after that guess the tree equal with the hidden.

If your program will make more than 80 operations it can get any verdict, because it will continue reading from closed input. If your program will make operation or print the answer in the incorrect format, it can get any verdict too. Be careful.

Don't forget to flush the output after printing questions and answers.

To flush the output, you can use: 

  * fflush(stdout) in C++. 
  * System.out.flush() in Java. 
  * stdout.flush() in Python. 
  * flush(output) in Pascal. 
  * See the documentation for other languages. 



Hacks:

The first line should contain one integer n — the number of vertices in the tree (2 ≤ n ≤ 1000). Next n-1 lines should contain 2 integers a_i, b_i — indexes of the vertices connected by i-th edge of the tree (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i). All edges should form a tree. Be careful, extra spaces or line breaks are not allowed.

Example

Input


5
00000
11011
11100
10010


Output


? 0 0 0 0 0
? 1 1 2 0 2
? 0 0 0 1 0
? 0 1 0 0 1
!
4 2
1 5
3 4
4 1

Note

It is a picture of the tree which encrypt the device from the first test:

<image>

It is a table of pairwise distances between vertices in this tree:

<image>

  * If you make operation where d = [0, 0, 0, 0, 0], no lamp will switch on, because dist(i, j) > 0 for all i ≠ j. 
  * If you make operation where d = [1, 1, 2, 0, 2], all lamps except the lamp connected with the 3-rd vertex will switch on. For example, lamp connected with the 1-st vertex will switch on, because dist(1, 5) = 1 ≤ 2 = d_5. 
  * If you make operation where d = [0, 0, 0, 1, 0], all lamps except lamps connected with the 4-th and 5-th vertices will switch on. 
  * If you make operation where d = [0, 1, 0, 0, 1], only lamps connected with the 1-st and 4-th vertices will switch on. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int MAXN = 1000 + 5;
char str[MAXN];
int n;
inline std::vector<int> query(std::vector<int> d) {
  std::vector<int> ans;
  printf("? ");
  for (auto x : d) printf("%d ", x);
  puts("");
  std::fflush(stdout);
  scanf("%s", str + 1);
  for (int i = 1; i <= n; ++i) ans.push_back(str[i] - '0');
  return ans;
}
std::vector<int> G[MAXN];
std::vector<int> node[MAXN * 50];
int tot = 1;
struct Node {
  int l, r, id;
  Node(int l = 0, int r = 0, int id = 0) : l(l), r(r), id(id) {}
  inline bool operator<(const Node &t) const { return l < t.l; }
};
int fa[MAXN];
inline void work(std::vector<int> id, int bit) {
  std::vector<int> d;
  d.resize(n);
  for (auto x : id) {
    for (auto y : G[x - 1])
      if ((y >> bit) & 1) d[y - 1] = 1;
  }
  std::vector<int> a;
  a = query(d);
  for (auto x : id) {
    for (auto y : G[x]) fa[y] |= (a[y - 1] << bit);
  }
}
bool tag[MAXN];
int main() {
  scanf("%d", &n);
  std::vector<Node> now;
  G[0].push_back(1);
  now.push_back(Node(0, n, 1));
  for (int i = 2; i <= n; ++i) node[tot].push_back(i);
  while (!now.empty()) {
    std::vector<Node> v1, v2;
    std::sort(now.begin(), now.end());
    for (int i = 0; i < now.size(); i += 2) {
      v1.push_back(now[i]);
      if (i + 1 < now.size()) v2.push_back(now[i + 1]);
    }
    std::vector<int> d, a1, a2;
    d.resize(n);
    now.clear();
    memset(tag, 0, sizeof(tag));
    for (auto x : v1) {
      int mid = (x.l + x.r) >> 1;
      assert(x.l < x.r - 1);
      for (auto y : G[x.l]) d[y - 1] = mid - x.l - 1, tag[y - 1] = 1;
    }
    a1 = query(d);
    for (int i = 0; i <= n - 1; ++i)
      if (tag[i]) d[i]++;
    a2 = query(d);
    for (auto x : v1) {
      int mid = (x.l + x.r) >> 1;
      Node ls = Node(x.l, mid, ++tot), rs = Node(mid, x.r, ++tot);
      for (auto y : node[x.id]) {
        if (!a1[y - 1] && a2[y - 1])
          G[mid].push_back(y);
        else if (a1[y - 1])
          node[ls.id].push_back(y);
        else
          node[rs.id].push_back(y);
      }
      if (ls.l + 1 < ls.r) now.push_back(ls);
      if (rs.l + 1 < rs.r) now.push_back(rs);
    }
    d.clear();
    d.resize(n);
    memset(tag, 0, sizeof(tag));
    for (auto x : v2) {
      int mid = (x.l + x.r) >> 1;
      assert(x.l < x.r - 1);
      for (auto y : G[x.l]) d[y - 1] = mid - x.l - 1, tag[y - 1] = 1;
    }
    a1 = query(d);
    for (int i = 0; i <= n - 1; ++i)
      if (tag[i]) d[i]++;
    a2 = query(d);
    for (auto x : v2) {
      int mid = (x.l + x.r) >> 1;
      Node ls = Node(x.l, mid, ++tot), rs = Node(mid, x.r, ++tot);
      for (auto y : node[x.id]) {
        if (!a1[y - 1] && a2[y - 1])
          G[mid].push_back(y);
        else if (a1[y - 1])
          node[ls.id].push_back(y);
        else
          node[rs.id].push_back(y);
      }
      if (ls.l + 1 < ls.r) now.push_back(ls);
      if (rs.l + 1 < rs.r) now.push_back(rs);
    }
  }
  for (int i = 0; i <= 9; ++i) {
    std::vector<int> v1, v2, v3;
    for (int i = 1; i < n; i += 3) {
      v1.push_back(i);
      if (i + 1 < n) v2.push_back(i + 1);
      if (i + 2 < n) v3.push_back(i + 2);
    }
    work(v1, i);
    work(v2, i);
    work(v3, i);
  }
  puts("!");
  for (int i = 2; i <= n; ++i) printf("%d %d\n", fa[i], i);
  std::fflush(stdout);
  return 0;
}