//ts
#include <bits/stdc++.h>
//The quick brown fox jumps over the lazy dog//
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define ashar(x) setprecision(x)
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
#define TXT freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define int ll
const int inf = 1e9;
const int maxn = 1000010;
int n, t;
int a[maxn], ind[maxn];
int sum, mx1, mx2, mn1, mn2, ans, f, s;
int psum[maxn];
bool mark[maxn];
map <pii, int> cnt;

int jam(int s, int e)
{
	return (s + e) * ( e - s + 1 ) / 2;
}

void add(int i, int j)
{
	if(i < j)
		swap(i, j);
	//cout << "@ " << a[i] << " " << a[j] << "\n";
	cnt[{a[i], a[j]}] ++;
}

int ffpos(int sum, int del, int s, int e)
{
	sum -= del;
	return jam(s, e) - sum;
}

int32_t main()
{
	fast_io
	cin >> t; 
	while(t--)
	{
		cin >> n;
		cnt.clear();
		mx1 = mx2 = 0;
		mn1 = mn2 = inf;
		f = s = ans = sum = 0;
		
		for(int i = 1; i <= n; i++ ) 
		{
			cin >> a[i];
			ind[a[i]] = i;
			mark[i] = 0;
		}
		
		for(int i = 1; i <= n; i++)
		{
			//cout << " ################### " << i << "\n";
			int pos = ind[i];
			sum += pos;
			if(pos > mx1)
			{
				mx2 = mx1;
				mx1 = pos;
			}
			else if(pos > mx2)	mx2 = pos;
			if(pos < mn1)
			{
				mn2 = mn1;
				mn1 = pos;
			}
			else if(pos < mn2) mn2 = pos;
			
			if(i == 1) continue;
			
			if(mx1 - mn1 + 1 == i){
				mark[i] = 1;
				if(mx1 < n) add(mn1, mx1 + 1);
				if(mn1 > 1) add(mn1 - 1, mx1);
			}
			
			if(mx2 - mn1 + 1 == i) 
			{
				int p = ffpos(sum, mx1, mn1, mx2);
				add(mx1, p);
			}
			
			if(mx2 - mn1 + 1 == (i - 1) and mx1 != mx2 + 1)
			{
				add(mx1, mx2 + 1);
				if(mn1 > 1)
				add(mx1, mn1 - 1);
			}
			
			if(mx1 - mn2  + 1== i)
			{
				int p = ffpos(sum, mn1, mn2, mx1);
				add(mn1, p);
			}
			if(mx1 - mn2 + 1 == (i - 1) and mn1 != mn2 - 1)
			{
		//		cout <<"ii" << i <<" " << mn1 <<" " << mn2 <<" " << mx1 <<" " << mx2 <<"\n";
				add(mn1, mn2 - 1);
				if(mx1 < n)
				add(mn1, mx1 + 1);	
			}
		//	cout <<"i:  " << i << " mn1 " << mn1 << " mn2 " << mn2 << " mx1 " << mx1 << " mx2 " << mx2 << " " << cnt[{2, 1}] << endl;
		}
		mark[1] = 0;
		for(int i = 1; i <= n; i++)
		{
		//	cout << " $ " << i << " " << mark[i] << "\n";
			psum[i] = mark[i] + psum[i - 1];
		}
		for(auto i: cnt)
		{
			int a = i.F.F;
			int b = i.F.S;
			if(b > a) swap(a, b);
			int good = psum[a - 1] - psum[b - 1];
			int res = i.S - good;
			//cout << " ~ " << a << " " << b << " " << res << " "  << i.S << " " << good << "\n";
			if(res > ans)
			{
				f = ind[b];
				s = ind[a];
				ans = res;
			}
		}
		if(!f)
			cout <<"1 1\n";
		else
			cout << f  << " " << s << endl;
	}
	return 0;
}