#include<cstdio>
#include<set>
#include<algorithm>
using namespace std;
typedef long long LL;

LL a[1000011]; 
int main() {
    LL t;
    scanf("%lld",&t);
    while(t--) {
        LL n;
        scanf("%lld",&n);
        for(LL i=0;i<n;++i) {
            scanf("%lld",&a[i]);
        }
        set<LL> ss;
        LL i=0;
        LL ans=0;
        while(i<n) {
            LL j=i;
            while(j<n&&!ss.count(a[j]) ) {
                ss.insert(a[j]);
                ++j;
            }
            ss.clear();
            ans++;
            i=j;
        } 
        printf("%lld\n",ans);
    }
    return 0;
}