Problem: Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archie would notice the difference between the previous and the new color. Archie always comments on Linda's hair color if and only if he notices a difference — so Linda always knows whether Archie has spotted the difference or not.

There is a new hair dye series in the market where all available colors are numbered by integers from 1 to N such that a smaller difference of the numerical values also means less visual difference.

Linda assumes that for these series there should be some critical color difference C (1 ≤ C ≤ N) for which Archie will notice color difference between the current color color_{new} and the previous color color_{prev} if \left|color_{new} - color_{prev}\right| ≥ C and will not if \left|color_{new} - color_{prev}\right| < C.

Now she has bought N sets of hair dye from the new series — one for each of the colors from 1 to N, and is ready to set up an experiment. Linda will change her hair color on a regular basis and will observe Archie's reaction — whether he will notice the color change or not. Since for the proper dye each set should be used completely, each hair color can be obtained no more than once.

Before the experiment, Linda was using a dye from a different series which is not compatible with the new one, so for the clearness of the experiment Archie's reaction to the first used color is meaningless.

Her aim is to find the precise value of C in a limited number of dyes. Write a program which finds the value of C by experimenting with the given N colors and observing Archie's reactions to color changes.

Interaction

This is an interactive task. In the beginning you are given a single integer T (1 ≤ T ≤ 100), the number of cases in the test.

For each test case, the input first contains a single integer — the value of N (1 < N ≤ 10^{18}). The value of C is kept secret by the grading system.

Then your program should make queries writing output in the following format: "? P", where P is an integer (1 ≤ P ≤ N) denoting the next color used. For each query the grading system gives an answer in the next line of the input. The answer is 1 if Archie notices the color difference between the last two colors and 0 otherwise. No two queries should have the same P value.

When your program determines C, it should output its value in the following format: "= C". The grading system will not respond to this output and will proceed with the next test case.

Your program may use at most 64 queries "?" for each test case to find the correct value of C.

To establish proper communication between your program and the grading system, you should flush the output stream after each query.

$$$\begin{array}{ll} Language & Command \\\ \hline C++ & std::cout << std::endl; \\\ Java & System.out.flush(); \\\ Python & sys.stdout.flush() \end{array}$$$ Flush commands 

Note that std::endl writes a newline and flushes the stream.

It is possible to receive an "Output isn't correct" outcome even after printing a correct answer, if task constraints were violated during the communication. Violating the communication protocol itself may result in an "Execution killed" outcome.

Submitting user tests requires specifying an input file with the testcase parameters. The format of the input file is "T" in the first line, and then "N C" on a single line for each of the T cases.

Scoring

Subtasks: 

  1. (9 points) N ≤ 64 
  2. (13 points) N ≤ 125 
  3. (21 points) N ≤ 1000 
  4. (24 points) N ≤ 10^9 
  5. (33 points) No further constraints. 

Example

Input


1

7

1

1

0

0

1


Output



? 2

? 7

? 4

? 1

? 5

= 4

Note

Comments to the example input line by line: 

  1. N = 7. 
  2. Answer to the first query is meaningless (can also be 0). 
  3. C ≤ 5. 
  4. 3 < C ≤ 5. It would be wise to check difference 4. However, this can not be done in the next query since 4 + 4 = 8 and 4 - 4 = 0 both are outside the allowed interval 1 ≤ P ≤ 7. 
  5. 3 < C ≤ 5. 
  6. 3 < C ≤ 4. Therefore, C = 4. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
std::mt19937 rnd(
    (int)std::chrono::steady_clock::now().time_since_epoch().count());
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
bool local = false;
long long locneed, loclast;
int nq;
set<long long> locseen;
long long n;
bool query(long long x) {
  ++nq;
  if (!local) {
    printf("? %lld\n", x + 1);
    fflush(stdout);
    int res;
    scanf("%d", &res);
    return res == 1;
  } else {
    assert(x >= 0 && x < n && !locseen.count(x));
    locseen.insert(x);
    long long have = abs(loclast - x);
    loclast = x;
    return have >= locneed;
  }
}
struct Strat {
  long long cnt;
  int l = -1, r = -1;
  long long start, jump;
  Strat(long long cnt) : cnt(cnt) {}
};
vector<Strat> strat;
int ensure(long long cnt) {
  assert(((int)(strat).size()) >= 1);
  int lastidx = ((int)(strat).size()) - 1;
  long long lastcnt = strat[lastidx].cnt;
  assert(cnt <= lastcnt);
  if (cnt == lastcnt) return lastidx;
  strat.push_back(Strat(cnt));
  return ((int)(strat).size()) - 1;
}
long long solve() {
  strat.clear();
  strat.push_back(Strat(n));
  for (int i = (0); i < (((int)(strat).size())); ++i) {
    long long cnt = strat[i].cnt;
    if (cnt == 1) continue;
    int r = ensure((cnt + 1) / 2);
    int l = ensure(cnt / 2);
    strat[i].r = r;
    strat[i].l = l;
  }
  for (int i = ((int)(strat).size()) - 1; i >= 0; --i) {
    long long cnt = strat[i].cnt;
    if (cnt == 1) {
      strat[i].start = 0;
      strat[i].jump = -1;
      continue;
    }
    strat[i].jump = cnt / 2;
    strat[i].start = cnt - 1 - strat[i].jump - strat[strat[i].r].start;
  }
  int dir = +1;
  int at = 0;
  long long last = strat[at].start, extrajump = 0;
  query(last);
  while (strat[at].cnt != 1) {
    long long next = last + dir * (extrajump + strat[at].jump);
    bool notice = query(next);
    if (notice) {
      at = strat[at].l;
    } else {
      extrajump += strat[at].jump;
      at = strat[at].r;
    }
    last = next;
    dir = -dir;
  }
  return extrajump + 1;
}
void run() {
  scanf("%lld", &n);
  printf("= %lld\n", solve());
  fflush(stdout);
}
void stress() {
  local = true;
  int mxq = -1;
  for (int rep = (0); rep < (10000); ++rep) {
    n = rnd() % 1000000000 + 1;
    locneed = rnd() % n + 1;
    nq = 0;
    locseen.clear();
    long long ans = solve();
    assert(ans == locneed);
    printf(".");
  }
}
int main() {
  int ncase;
  scanf("%d", &ncase);
  for (int i = (1); i <= (ncase); ++i) run();
  return 0;
}