#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <set>
using namespace std;
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n, ans = 1;
        long long num;
        set<long long>Q;
        set<long long>::iterator it;
        scanf("%d", &n);
        for(int i=1; i<=n; i++)
        {
            scanf("%I64d", &num);
            it = Q.find(num);
            if(it == Q.end())
            {
                Q.insert(num);
            }
            else
            {
                Q.clear();
                Q.insert(num);
                ans++;
            }

        }
        Q.clear();
        printf("%d\n", ans);
    }
    return 0;
}