#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>

using namespace std;

const int maxn = 1e5 + 5;

int a[maxn];
map<int, int> mp;

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n;
        scanf("%d", &n);
        for(int i = 1; i <= n; ++i)
        {
            scanf("%d", &a[i]);
        }
        int ans = 0;
        for(int i = 1, j = 1; i <= n; i = j)
        {
            mp.clear();
            while(j <= n && mp.find(a[j]) == mp.end())
            {
                mp[a[j]] = 1;
                ++j;
            }
            ++ans;
        }
        printf("%d\n", ans);
    }
    return 0;
}