#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

int ans = -1;
bool suc = 0;
int cnt = 0;
int n;
int sum = 0;
int query(int l, int r)
{
    ++cnt;
    assert(cnt <= (int)ceil(1.5L * log2(n)));
    assert(sum <= 3 * n);
    cout << "? " << l << " " << r << endl;
    sum += r - l + 1;
    int x;
    cin >> x;
    return x;
}
int make(int l, int r, int t)
{
    // cout << "Debug  =  " << l << " " << r << " " << t << endl;
    if (suc)
    {
        return ans;
    }
    if (r - l == 0)
    {
        suc = 1;
        return l;
    }
    else if (r - l == 1)
    {
        suc = 1;
        return r + l - t;
    }
    if (t <= (l + r) / 2)
    {
        int mid = (2 * r + l) / 3;
        int s = query(l, mid);
        if (suc)
        {
            return ans;
        }
        if (s == t)
        {
            return make(l, mid, s);
        }
        else
        {
            if (mid + 1 == r)
            {
                suc = 1;
                return mid + 1;
            }
            int x = query(mid + 1, r);
            return make(mid + 1, r, x);
        }
    }
    else
    {
        int mid = (2 * l + r + 2) / 3;
        int s = query(mid, r);
        if (s == t)
        {
            return make(mid, r, s);
        }
        else
        {
            if (l == mid - 1)
            {
                suc = 1;
                return l;
            }
            int x = query(l, mid - 1);
            return make(l, mid - 1, x);
        }
    }
    if (suc)
    {
        return ans;
    }
}

void solve()
{
    cnt = 0;
    suc = 0;
    sum = 0;
    ans = -1;
    cin >> n;

    int t = query(1, n);
    int ans = make(1, n, t);
    // assert(ans != -1);
    cout << "! " << ans << endl;
}
signed main()
{
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}