#include <cstdio>
#include <algorithm>

using namespace std;

int T, n;

int ask(int x, int y, int z = 0)
{
    printf("? %d %d\n", x, y);
    fflush(stdout);
    scanf("%d", &z);
    return z;
}

void ans(int x, int y, int z = 0)
{
    printf("! %d %d\n", x, y);
    fflush(stdout);
    scanf("%d", &z);
}

int dis(int x, int y)
{
    if(x > y)
        swap(x, y);
    return min(y - x, x + n - y);
}

void work()
{
    scanf("%d", &n);

    if(n <= 8)
    {
        for(int i = 1; i <= n; ++ i)
            for(int j = i + 2; j <= n; ++ j)
                if(!(i == 1 && j == n) && ask(i, j) == 1)
                    return ans(i, j);
    }

    int u = 1, v = n / 2 + 1, w = n / 2, d = ask(u, v);
    while(d == w)
    {
        if(n & 1)
        {
            if(w == n / 2)
                ++ v, ++ w;
            else
                ++ u, -- w;
        }
        else
            ++ u, ++ v;
        d = ask(u, v);
    }

    if(d == 1)
        return ans(u, v);

    int delta = w - d;
    int x = u + 1, y = v, z = dis(x, y), k = ask(x, y);
    if(k == 1)
        return ans(x, y);
    if(z - k == delta)
        u = x, v = y, w = z, d = k;
    else
    {
        (-- u == 0) && (u = n);
        if(u > v)
            swap(u, v);
        w = dis(u, v), d = w - delta;
        if(d == 1)
            return ans(u, v);
    }

    int l = u, r = v - delta - 1;
    while(l <= r)
    {
        int mid = l + r >> 1;
        if(dis(mid, v) - ask(mid, v) == delta)
            r = mid - 1, x = mid;
        else
            l = mid + 1;
    }
    y = (x + delta + 1) % n;
    if(!y)
        y = n;
    if(ask(x, y) != 1)
    {
        y = ((x - delta - 1) % n + n) % n;
        if(!y)
            y = n;
    }

    ans(x, y);
}

int main()
{
    scanf("%d", &T);
    while(T --)
        work();

    return 0;
}