#include<bits/stdc++.h>
using namespace std;
int t;
int a[15005],ins[15005];
int f(int l,int r){
    stack<int>s;
    for(int i=l;i<=r;i++){
        if(ins[a[i]]){
            //cout<<111;
            while(!s.empty()&&s.top()!=a[i]){
                //cout<<"pop"<<s.top()<<"\n";
                ins[s.top()]=0;
                s.pop();
            } 
            //cout<<"pop"<<s.top()<<"\n";
            s.pop();
            ins[a[i]]=0;
        }else{
            //cout<<222;
            s.push(a[i]);
            //cout<<"push"<<a[i]<<"\n";
            ins[a[i]]=1;
        }
    }
    return s.size();
}
int main(){
    freopen("bamboo.in","r",stdin);
    freopen("bamboo.out","w",stdout);
    
    cin>>t;
    while(t--){
        int n,q;
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        cin>>q;
        while(q--){
            int l,r;
            cin>>l>>r;
            for(int i=1;i<=n;i++) ins[a[i]]=0;
            cout<<f(l,r)<<"\n";
        }
    }
    return 0;
}