#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
const int maxn=100010;
set<int>s;
int T,n,a[maxn],ans;
int main(){
    scanf("%d",&T);
    while(T--){
        s.clear();
        scanf("%d",&n);
        ans=0;
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            if(s.count(a[i])){
                ans++;
                s.clear();
            }
            s.insert(a[i]);
        }
        printf("%d\n",ans+1);
    }
    return 0;
}