# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iostream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <set>
# include <cmath>
# include <algorithm>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi 3.1415926535
# define eps 1e-9
# define MOD 20100403
# define INF 1000000000
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define bug puts("H");
# define lch p<<1,l,mid
# define rch p<<1|1,mid+1,r
# define mp make_pair
# define pb push_back
typedef pair<int,int> PII;
typedef vector<int> VI;
# pragma comment(linker, "/STACK:1024000000,1024000000")
typedef long long LL;
int Scan() {
    int res=0, flag=0;
    char ch;
    if((ch=getchar())=='-') flag=1;
    else if(ch>='0'&&ch<='9') res=ch-'0';
    while((ch=getchar())>='0'&&ch<='9')  res=res*10+(ch-'0');
    return flag?-res:res;
}
void Out(int a) {
    if(a<0) {putchar('-'); a=-a;}
    if(a>=10) Out(a/10);
    putchar(a%10+'0');
}
const int N=100005;
//Code begin...

map<LL,int>vis;
LL a[N];
int to[N];

int main ()
{
    int n, ans, T;
    scanf("%d",&T);
    while (T--) {
        vis.clear(); mem(to,0); ans=0;
        scanf("%d",&n);
        FOR(i,1,n) {
            scanf("%I64d",a+i);
            if (vis.find(a[i])!=vis.end()) to[i]=vis[a[i]];
            vis[a[i]]=i;
        }
        int now=1;
        while (now<=n) {
            int i=now;
            for (; i<=n; ++i) if (to[i]>=now) break;
            ++ans;
            now=i;
        }
        printf("%d\n",ans);
    }
    return 0;
}