Problem: [MisoilePunch♪ - 彩](https://www.youtube.com/watch?v=5VleIdkEeak)

This is an interactive problem!

On a normal day at the hidden office in A.R.C. Markland-N, Rin received an artifact, given to her by the exploration captain Sagar.

After much analysis, she now realizes that this artifact contains data about a strange flower, which has existed way before the New Age. However, the information about its chemical structure has been encrypted heavily.

The chemical structure of this flower can be represented as a string p. From the unencrypted papers included, Rin already knows the length n of that string, and she can also conclude that the string contains at most three distinct letters: "C" (as in Carbon), "H" (as in Hydrogen), and "O" (as in Oxygen).

At each moment, Rin can input a string s of an arbitrary length into the artifact's terminal, and it will return every starting position of s as a substring of p.

However, the artifact has limited energy and cannot be recharged in any way, since the technology is way too ancient and is incompatible with any current A.R.C.'s devices. To be specific:

  * The artifact only contains 7/5 units of energy. 
  * For each time Rin inputs a string s of length t, the artifact consumes (1)/(t^2) units of energy. 
  * If the amount of energy reaches below zero, the task will be considered failed immediately, as the artifact will go black forever. 



Since the artifact is so precious yet fragile, Rin is very nervous to attempt to crack the final data. Can you give her a helping hand?

Interaction

The interaction starts with a single integer t (1 ≤ t ≤ 500), the number of test cases. The interaction for each testcase is described below:

First, read an integer n (4 ≤ n ≤ 50), the length of the string p.

Then you can make queries of type "? s" (1 ≤ |s| ≤ n) to find the occurrences of s as a substring of p.

After the query, you need to read its result as a series of integers in a line:

  * The first integer k denotes the number of occurrences of s as a substring of p (-1 ≤ k ≤ n). If k = -1, it means you have exceeded the energy limit or printed an invalid query, and you need to terminate immediately, to guarantee a "Wrong answer" verdict, otherwise you might get an arbitrary verdict because your solution will continue to read from a closed stream.
  * The following k integers a_1, a_2, …, a_k (1 ≤ a_1 < a_2 < … < a_k ≤ n) denote the starting positions of the substrings that match the string s.



When you find out the string p, print "! p" to finish a test case. This query doesn't consume any energy. The interactor will return an integer 1 or 0. If the interactor returns 1, you can proceed to the next test case, or terminate the program if it was the last testcase.

If the interactor returns 0, it means that your guess is incorrect, and you should to terminate to guarantee a "Wrong answer" verdict.

Note that in every test case the string p is fixed beforehand and will not change during the queries, i.e. the interactor is not adaptive.

After printing any query do not forget to print end of line and flush the output. Otherwise, you might 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 the documentation for other languages.



Hacks

For hack, use the following format. Note that you can only hack with one test case:

The first line should contain a single integer t (t = 1).

The second line should contain an integer n (4 ≤ n ≤ 50) — the string's size.

The third line should contain a string of size n, consisting of characters "C", "H" and "O" only. This is the string contestants will have to find out.

Examples

Input


1
4

2 1 2

1 2

0

1

Output




? C

? CH

? CCHO

! CCHH



Input


2
5

0

2 2 3

1
8

1 5

1 5

1 3

2 1 2

1

Output




? O

? HHH

! CHHHH


? COO

? COOH

? HCCOO

? HH

! HHHCCOOH

Note

Note that the example interaction contains extra empty lines so that it's easier to read. The real interaction doesn't contain any empty lines and you shouldn't print any extra empty lines as well.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void ckmax(T& x, T y) {
  x = (y > x ? y : x);
}
template <typename T>
inline void ckmin(T& x, T y) {
  x = (y < x ? y : x);
}
const int MAXN = 50;
int n;
char ans[MAXN + 5];
inline void fix(int i, char c) {
  assert(ans[i] == 0 || ans[i] == c);
  ans[i] = c;
}
vector<int> ask(string s) {
  cout << "? " << s << endl;
  vector<int> res;
  int k;
  cin >> k;
  if (k == -1) exit(0);
  res.resize(k);
  for (int i = 0; i < k; ++i) {
    cin >> res[i];
    assert(res[i] + ((int)(s).size()) - 1 <= n);
    for (int j = 0; j < ((int)(s).size()); ++j) {
      fix(res[i] + j, s[j]);
    }
  }
  return res;
}
void report_ans() {
  cout << "! ";
  for (int i = 1; i <= n; ++i) cout << ans[i];
  cout << endl;
  int t;
  cin >> t;
  if (t == 0) exit(0);
}
vector<char> ch[MAXN + 5];
bool dfs(int idx, string s, bool flag) {
  if (idx == n + 1) {
    if (flag) {
      report_ans();
      return true;
    }
    if (((int)(ask(s)).size())) {
      report_ans();
      return true;
    }
    return false;
  }
  for (int i = 0; i < ((int)(ch[idx]).size()); ++i) {
    ans[idx] = ch[idx][i];
    bool t = dfs(idx + 1, s + ch[idx][i],
                 flag && (i == ((int)(ch[idx]).size()) - 1));
    if (t) return true;
  }
  return false;
}
void solve_case() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    ans[i] = 0;
    vector<char>().swap(ch[i]);
  }
  if (n > 4) {
    ask("CC");
    ask("CH");
    ask("CO");
    ask("HO");
    ask("OO");
    for (int i = 2; i < n; ++i) {
      if (ans[i] == 0) {
        ans[i] = 'H';
      }
    }
    for (int i = 1; i <= n; ++i) {
      if (ans[i] != 0) {
        ch[i].push_back(ans[i]);
      } else if (i == 1) {
        ch[i].push_back('H');
        ch[i].push_back('O');
      } else {
        ch[i].push_back('C');
        ch[i].push_back('H');
      }
    }
    dfs(1, "", 1);
  } else {
    vector<int> tmp;
    bool flag = 0;
    tmp = ask("CC");
    if (((int)(tmp).size())) flag = 1;
    tmp = ask("CH");
    if (((int)(tmp).size())) flag = 1;
    tmp = ask("CO");
    if (((int)(tmp).size())) flag = 1;
    tmp = ask("HO");
    if (((int)(tmp).size())) flag = 1;
    if (flag) {
      for (int i = 1; i <= n; ++i) {
        if (ans[i] != 0) {
          ch[i].push_back(ans[i]);
        } else if (i <= 3) {
          ch[i].push_back('H');
          ch[i].push_back('O');
        } else {
          ch[i].push_back('C');
          ch[i].push_back('H');
          ch[i].push_back('O');
        }
      }
      dfs(1, "", 1);
      return;
    }
    tmp = ask("OO");
    if (((int)(tmp).size())) {
      if (ans[1] == 'O' && ans[2] == 'O' && ans[3] == 'O' && ans[4] == 'O') {
        report_ans();
        return;
      } else if (ans[1] == 'O' && ans[2] == 'O' && ans[3] == 'O') {
        ch[1].push_back('O');
        ch[2].push_back('O');
        ch[3].push_back('O');
        assert(ans[4] == 0);
        ch[4].push_back('C');
        ch[4].push_back('H');
        dfs(1, "", 1);
        return;
      } else if (ans[1] == 'O' && ans[2] == 'O') {
        ans[3] = 'H';
        ch[1].push_back('O');
        ch[2].push_back('O');
        ch[3].push_back('H');
        assert(ans[4] == 0);
        ch[4].push_back('C');
        ch[4].push_back('H');
        dfs(1, "", 1);
        return;
      }
      assert(0);
    }
    ans[2] = ans[3] = 'H';
    ask("HHH");
    if (!ans[1]) {
      ans[1] = 'O';
    }
    if (!ans[4]) {
      ans[4] = 'C';
    }
    report_ans();
    return;
  }
}
int main() {
  int T;
  cin >> T;
  while (T--) {
    solve_case();
  }
  return 0;
}