use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    let t = read();
    for _ in 0..t {
        println!("! {}", solve());
    }
}

fn solve() -> usize {
    let n = read();
    let mut cnt = 0;
    let mut query = |a: usize, b: usize| -> usize {
        cnt += 1;
        assert!(1 <= a.min(b) && a != b && a.max(b) <= n);
        assert!(cnt <= (n + 1) / 2 + 3);
        println!("? {} {}", a, b);
        read()
    };
    let mut edge = (0, 0);
    for i in (1..=n).step_by(2) {
        let l = i;
        let r = i % n + 1;
        if query(l, r) == 1 {
            edge = (l, r);
            break;
        }
    }
    let (x, y) = edge;
    let mut v = (1..=n).collect::<Vec<_>>();
    v.retain(|v| *v != x && *v != y);
    let a = v[0];
    let b = v[1];
    if query(x, a) == 1 {
        return if query(x, v[1]) == 1 {
            2
        } else {
            1
        };
    }
    if query(y, a) == 0 {
        return 1;
    }
    if query(y, b) == 1 {
        2
    } else {
        1
    }
}

fn read() -> usize {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().parse().unwrap()
}