#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define fi first
#define se second
#define clr(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int T, n;
ll a[maxn];
int main() {
    scanf("%d", &T);
    while(T--) {
        scanf("%d", &n);
        for(int i = 0; i < n; i++) {
            scanf("%lld", &a[i]);
        }
        ll ans = 0;
        set<ll> s;
        for(int i = 0; i < n; i++) {
            if(s.count(a[i]) == 0) {
                s.insert(a[i]);
            }
            else {
                ans++;
                s.clear();
                s.insert(a[i]);
            }
        }
        printf("%lld\n", ans + 1);
    }
    return 0;
}