/* Problem URL: https://codeforces.com/contest/2168/problem/B */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve1()
{
    int n;
    cin >> n;
    vi a(n);
    cin >> a;

    int pos1;
    int pos2;

    rep(i, n) {
        if (a[i] == 1) {
            pos1 = i;
            continue;
        }

        if (a[i] == n) {
            pos2 = i;
        }
    }

    cout << (pos1 < pos2) << '\n';
}

void solve2()
{
    int n, x;
    cin >> n >> x;

    int low = 0;
    int high = n - 1;
    int l = 1;
    while (low <= high) {
        int mid = (low + high) >> 1;

        cout << "? " << mid + 1 << ' ' << n << endl;
        int ans;
        cin >> ans;

        if (ans == n - 1) {
            l = mid + 1;
            low = mid + 1;
            continue;
        }

        high = mid - 1;
    }

    low = 0;
    high = n - 1;
    int r = n;
    while (low <= high) {
        int mid = (low + high) >> 1;

        cout << "? 1 " << mid + 1 << endl;
        int ans;
        cin >> ans;

        if (ans == n - 1) {
            r = mid + 1;
            high = mid - 1;
            continue;
        }

        low = mid + 1;
    }

    if (x) {
        cout << "! " << r << endl;
        return;
    }

    cout << "! " << l << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    void (*solve[])() = {solve1, solve2};
    string op;
    cin >> op;
    bool s = op[0] != 'f';

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve[s]();
    }
}