Problem: This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.flush().

In this problem, you need to find maximal and minimal elements of an array. What could be simpler?

You can imagine that the jury has an array, and initially you know the only number n — array's length.

Array's elements are numbered from 1 to n. You are allowed to compare two elements of the array by using their indices i and j. There are three possible responses to this query: '<' (if ai is less than aj), '=' (if ai is equal to aj) and finally '>' (if ai is greater than aj).

It's known that it's always possible to find both maximal and minimal elements of the array by using no more than <image> comparisons, where ⌈ x⌉ is the result of rounding x up.

Write the program that will find positions of the minimum and the maximum in the jury's array of length n, by using no more than f(n) comparisons.

Interaction

Each test for this problem will contain one or more arrays. You have to find positions of minimal and maximal elements for each of these arrays. The first line of the input contains integer T (1 ≤ T ≤ 1000) — number of arrays in the test.

Thus, at the beginning, you program should read number T, and then it should solve the problem for T jury's arrays one by one.

Then input for each array goes. Firstly, your program has to read the number n (1 ≤ n ≤ 50) — the length of the array. It will be provided in the next line of the input.

Further, your program can perform comparisons or report that the answer is found.

  * To perform a comparison, you have to output string of the following pattern «? i j» (i and j must be integer numbers from 1 to n) — the indices of the elements to compare in the current query. 
  * To report the indices of minimal and maximal elements of the hidden array, your program have to output a line in the form «! i j» (i and j must be integer numbers from 1 to n), where i is an index of the minimal element of array, and j is an index of the maximal element of the array. If there are several possible answers to the problem, you can output any of them. 



There are several possible responses for a comparison:

  * '<' — if ai is less than aj, 
  * '=' — if ai is equal to aj, 
  * '>' — if ai is greater than aj. 



For an array of length n your program can make at most <image> comparisons. Note that the operation of reporting an answer («! i j» ) is not included into the value of f(n).

After the answer is reported, your program has to solve the problem for the next array or it should terminate if all T arrays are processed.

Example

Input

2
2
 
&gt;
 
3
 
=
 
=
 

Output

 
 
? 1 2
 
! 2 1
 
? 3 1
 
? 2 1
 
! 2 3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int ans[55][55];
int t;
int n;
vector<int> fight;
vector<int> fight_min[50];
vector<int> fight_max[50];
int sz;
int resp;
int nw;
int mi, ma;
bool spec[55];
string x;
inline void answer(int mi, int ma) {
  cout << '!' << ' ' << mi << ' ' << ma << '\n';
  fflush(stdout);
}
inline int ask(int i, int j) {
  if (ans[i][j] != -2) return ans[i][j];
  string an;
  cout << "? " << i << ' ' << j << '\n';
  fflush(stdout);
  getline(cin, an);
  if (an == "=") return ans[i][j] = ans[j][i] = 0;
  if (an == "<") return -1 * (ans[j][i] = -1 * (ans[i][j] = -1));
  return -1 * (ans[j][i] = -1 * (ans[i][j] = 1));
}
int main() {
  cin >> t;
  while (t--) {
    for (int i = 0; i < 55; ++i)
      for (int j = 0; j < 55; ++j) ans[i][j] = -2;
    fight.clear();
    for (int i = 0; i < 50; ++i) {
      fight_max[i].clear();
      fight_min[i].clear();
    }
    cin >> n;
    getline(cin, x);
    if (n == 1) {
      cout << "! 1 1\n";
      continue;
    }
    memset(spec, false, sizeof(spec));
    for (int i = 1; i <= n; ++i) fight.push_back(i);
    sz = fight.size();
    for (int i = 0; i < sz; i += 2) {
      if (i + 1 == sz) {
        fight_max[0].push_back(fight[i]);
        spec[fight[i]] = true;
      } else {
        resp = ask(fight[i], fight[i + 1]);
        if (resp == 0) {
          fight_max[0].push_back(fight[i]);
          fight_min[0].push_back(fight[i + 1]);
        } else if (resp == -1) {
          fight_max[0].push_back(fight[i + 1]);
          fight_min[0].push_back(fight[i]);
        } else if (resp == 1) {
          fight_min[0].push_back(fight[i + 1]);
          fight_max[0].push_back(fight[i]);
        }
      }
    }
    nw = 0;
    while (fight_max[nw].size() != 1) {
      sz = fight_max[nw].size();
      for (int i = 0; i < sz; i += 2) {
        if (i + 1 == sz) {
          fight_max[nw + 1].push_back(fight_max[nw][i]);
        } else {
          resp = ask(fight_max[nw][i], fight_max[nw][i + 1]);
          if (resp == 0) {
            if (spec[fight_max[nw][i]]) {
              fight_max[nw + 1].push_back(fight_max[nw][i]);
            } else
              fight_max[nw + 1].push_back(fight_max[nw][i + 1]);
          } else if (resp == -1) {
            fight_max[nw + 1].push_back(fight_max[nw][i + 1]);
            if (spec[fight_max[nw][i]]) {
              spec[fight_max[nw][i]] = false;
              fight_min[0].push_back(fight_max[nw][i]);
            }
          } else {
            fight_max[nw + 1].push_back(fight_max[nw][i]);
            if (spec[fight_max[nw][i + 1]]) {
              spec[fight_max[nw][i + 1]] = false;
              fight_min[0].push_back(fight_max[nw][i + 1]);
            }
          }
        }
      }
      ++nw;
    }
    ma = fight_max[nw][0];
    nw = 0;
    while (fight_min[nw].size() != 1) {
      sz = fight_min[nw].size();
      for (int i = 0; i < sz; i += 2) {
        if (i + 1 == sz) {
          fight_min[nw + 1].push_back(fight_min[nw][i]);
        } else {
          resp = ask(fight_min[nw][i], fight_min[nw][i + 1]);
          if (resp == 0) {
            fight_min[nw + 1].push_back(fight_min[nw][i]);
          } else if (resp == 1) {
            fight_min[nw + 1].push_back(fight_min[nw][i + 1]);
          } else {
            fight_min[nw + 1].push_back(fight_min[nw][i]);
          }
        }
      }
      ++nw;
    }
    mi = fight_min[nw][0];
    answer(mi, ma);
  }
  return 0;
}