#include <iostream>
#include <cstdio>
using namespace std;
const int N=2e4+10;
const int B=100; 
int T,n,nxt[N],t[N],a[N],q,to[N],w[N];
void work(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",a+i);
		t[a[i]]=0;
	}
	
	for(int i=n;i>=1;i--){
		nxt[i]=t[a[i]];
		t[a[i]]=i;
	}
	for(int i=1;i<=n;i++){
		int cnt=0,x=i;
		w[i]=0;
		for(int j=1;j<=B;j++){
			if(!nxt[x])break;
			cnt+=nxt[x]-x+1;
			x=nxt[x]+1;
		}
		to[i]=x,w[i]=cnt;
	}
	scanf("%d",&q);
	while(q--){
		int l,r,ans;
		scanf("%d %d",&l,&r);
		ans=r-l+1;
		for(int i=l;i<=r;i++){
			if(to[i]<=r){
				ans-=w[i];
				i=to[i];
			}
			if(nxt[i]&&nxt[i]<=r){
				ans-=nxt[i]-i+1;
				i=nxt[i];
			}
		}
		printf("%d\n",ans);
	}
	return;
}
int main(){
	freopen("bamboo.in","r",stdin); 
	freopen("bamboo.out","w",stdout);
	scanf("%d",&T);
	while(T--)work();
	return 0;
}