#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);
}

int move(int u, int k)
{
    u = ((u + k) % n + n) % n;
    return u == 0 ? n : u;
}

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(v - u == n / 2)
                ++ v;
            else
                ++ u;
        }
        else
            ++ u, ++ v;
        d = ask(u, v);
    }

    if(d == 1)
        return ans(u, v);
    int delta = w - d, flag = 0;
    if(ask(u, move(u, delta + 1)) == 1)
        return ans(u, move(u, delta + 1));
    if(ask(u, move(u, - delta - 1)) == 1)
        return ans(u, move(u, - delta - 1));

    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)
        flag = 1, w = v - u, delta = w - d;
    else
        flag = -1, w = n - v + u, delta = w - d;

    int l = 0, r = w;
    while(l <= r)
    {
        int mid = l + r >> 1, p = move(u, flag * mid);
        int dist = ((v - p) * flag + n) % n;
        if(dist - ask(p, v) >= delta)
            l = mid + 1, x = p;
        else
            r = mid - 1;
    }

    y = move(x, flag * (delta + 1));
    if(ask(x, y) != 1)
        y = move(v, flag * (ask(x, v) - 1));
    ans(x, y);
}

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

    return 0;
}