#include<iostream>
using namespace std;
int a[150005],nex[150005],last[15];
int main()
{
	int T;
	cin >> T;
	while(T--)
	{
		int n,q;
		cin >> n;
		for(int i = 1;i <= n;i++)
		{
			cin >> a[i];
			if(last[a[i]] != 0) nex[last[a[i]]] = i;
			last[a[i]] = i;
		}
		cin >> q;
		for(int i = 1;i <= q;i++)
		{
			int l,r,ans = 0;
			cin >> l >> r;
			for(int j = l;j <= r;j++)
			{
			//	cout << j << ' ' << nex[j] << endl;
				if(nex[j] != 0 && nex[j] <= r) j = nex[j];
				else ans++;
			}
			cout << ans << endl;
		}
	}
	return 0;
}

样例能过，提交全TLE