#include <bits/stdc++.h>
using namespace std;
const int N = 1.5e4 + 10;
int t, n, q, x, ans;
int f[14], r[N];
int main(){
    freopen("bamboo.in", "r", stdin);
    freopen("bamboo.out", "w", stdout);
    cin >> t;
    while(t--){
        scanf("%d", &n);
        for(int i = 1;i <= 13;i++) f[i] = 0;
        for(int i = 1;i <= n;i++) r[i] = 0;
        for(int i = 1;i <= n;i++){
            scanf("%d", &x);
            r[f[x]] = i;
            f[x] = i;  
        }
        cin >> q;
        while(q--){
            int le, ri;
            ans = 0;
            cin >> le >> ri;
            for(int j = le;j <= ri;j++){
                if(r[j] < le || r[j] > ri) ans++;
                else j = r[j];
            }
            printf("%d\n", ans);
        }
        
    }
}