#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int maxn = 100000 + 10;
int a[maxn], c[maxn];
void solve()
{
    int n;
    cin >> n;
    memset(c, 0, sizeof(c[0]) * (n + 5));
    for (int i=1;i<=n;++i) cin >> a[i], ++c[a[i]];
    int x = 0, y = 0;
    for (int i=1;i<=n;++i)
        if (!x || c[i] > c[x]) y = x, x = i;
        else if (!y || c[i] > c[y]) y = i;
    int z = (c[x] & c[y]) ? (c[x] | c[y] | ((1 << 31 - __builtin_clz(c[x] & c[y])) - 1)) : (c[x] | c[y]);
    cout << z << '\n';
    int l = 1, r = n;
    while ((c[x] | c[y]) != z) --c[a[r--]];
    cout << l << ' ' << r << '\n' << x << ' ' << y << '\n';
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) solve();
    return 0;
}