#include <cstdio>
#include <map>
#define maxn 100009
using namespace std;
int n;
long long a[maxn];
map<long long, bool>mp;
void solve(){
    scanf("%d", &n);
    int ans = 1;
    mp.clear();
    for(int i = 1; i <= n; i++){
        scanf("%lld", &a[i]);
        if(mp[a[i]]){
            ans++;
            mp.clear();
            mp[a[i]] = 1;
        }
        else{
            mp[a[i]] = 1;
        }
    }
    printf("%d\n", ans);
}
int main(){
    int tt;
    scanf("%d", &tt);
    while(tt--){
        solve();
    }
    return 0;
}