#include<stdio.h>
int min(int a,int b){return a<b?a:b;}
int max(int a,int b){return a>b?a:b;}
int t,n,s[100005],ci[100005],beg[100005],end[100005];
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        for(int i=1;i<=n;i++) ci[i]=beg[i]=0;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&s[i]),ci[s[i]]++;
            if(!beg[s[i]]) beg[s[i]]=i;
            end[s[i]]=i;
        }
        int k1=0,k2=0;
        for(int i=1;i<=n;i++) if(ci[i]>=ci[k1]) k1=i;
        for(int i=1;i<=n;i++) if(ci[i]>=ci[k2]&&i!=k1) k2=i;
        int ans=ci[k1]|ci[k2],dq=ci[k1]&ci[k2],mi=1,nono=1,cc1=ci[k1],cc2=ci[k2];
        while(mi<=dq)
        {
            if(mi&dq) nono=mi;
            mi*=2;
        }
        int l=max(1,min(beg[k1],beg[k2])),r=max(end[k2],end[k1]);
        if((cc1|cc2)==(ans|(nono-1))){printf("%d\n%d %d\n%d %d\n",(ans|(nono-1)),l,r,k1,k2);continue;}
        while(l<=r)
        {
            if(s[l]==k1) cc1--;
            if(s[l]==k2) cc2--;
            l++;if((cc1|cc2)==(ans|(nono-1)))
            {printf("%d\n%d %d\n%d %d\n",
            (ans|(nono-1)),l,r,k1,k2);break;}
        }
    }
}