#include<bits/stdc++.h>
using namespace std;
const int N=5e4+5;
int a[N],dp[N];
int lst[14];
void solve()
{
	int n,q;
	cin>>n;
	for(int i=1;i<=13;++i)
		lst[i]=n+1;
	for(int i=1;i<=n;++i)
		cin>>a[i];
	for(int i=n;i;--i)
	{
		dp[i]=lst[a[i]];
		lst[a[i]]=i;
	}
	cin>>q;
	while(q--)
	{
		int x,y,ans=0;
		cin>>x>>y;
		while(x<=y)
		{
			if(dp[x]>y)
				++ans,++x;
			else
				x=dp[x]+1;
		}
		cout<<ans<<'\n';
	}
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	for(cin>>T;T;--T)
		solve();
}