#include<bits/stdc++.h>
using namespace std;
const int N=15005;
int n,q,a[N],suf[N],vis[15];
map<pair<int,int>,int>mp; 
void solve(){
	scanf("%d",&n);
	memset(vis,0,sizeof(vis));
	for(int i = 1;i<=n;i++) suf[i]=0;
	for(int i = 1;i<=n;i++) scanf("%d",&a[i]);
	for(int i = n;i>=1;i--){
		suf[i]=vis[a[i]];
		vis[a[i]]=i;
	}
	scanf("%d",&q);
	while(q--){
		int l,r,ans=0; scanf("%d%d",&l,&r);
		if(mp.count({l,r})) printf("%d\n",mp[{l,r}]);
		for(int i = l;i<=r;i++){
			if(suf[i]!=0&&suf[i]<=r) i=suf[i];
			else ans++;
		}
		mp[{l,r}]=ans; 
		printf("%d\n",ans);
	}
}
int main(){
	freopen("bamboo.in","r",stdin);
	freopen("bamboo.out","w",stdout);
	int _; cin>>_;
	while(_--) solve();
	return 0;
}