#include<bits/stdc++.h>
using namespace std;

const int MAXN = 2 * 1e4 + 5;
int T;
int n, q;
int a[MAXN];
int nxt[MAXN], pos[15];

int main(){
	freopen("bamboo.in", "r", stdin);
	freopen("bamboo.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> T;
	while(T --){
		cin >> n;
		for(int i = 1;i <= n;++ i){
			cin >> a[i];
			nxt[pos[a[i]]] = i;
			pos[a[i]] = i;
		}
		cin >> q;
		for(int i = 1;i <= q;++ i){
			int l, r; cin >> l >> r;
			int res = 0;
			for(int i = l;i <= r;++ i){
				if(nxt[i] >= l && nxt[i] <= r) i = nxt[i];
				else res ++;
			}
			cout << res << '\n';
		}
	}
	return 0;
}