#include<cstdio>
inline int read(){
	int x=0;
	int f=0,ch=0;
	while(ch<48||ch>57) f=(ch=='-'),ch=getchar();
	while(ch>47&&ch<58) x=(x<<3)+(x<<1)+(ch&15),ch=getchar();
	return f?-x:x;
}
inline void write(int x,char end=' '){
	if(x==0){
		putchar('0');
		putchar(end);
		return;
	}
	if(x<0) putchar('-'),x=-x;
	int ch[70]={0},cnt=0;
	while(x){
		ch[cnt++]=(int)(x%10);
		x/=10;
	}
	while(cnt--) putchar(ch[cnt]+48);
	putchar(end);
}
inline int max(int x,int y){return x>y?x:y;}
const int N=2e5+5;
int p[N],leaf[N];
struct node{
	int to,nxt;
}e[N<<1];
int head[N],cnt;
inline void add(int u,int v){
	e[++cnt].to=v;
	e[cnt].nxt=head[u];
	head[u]=cnt;
}
int can,ans;
inline void dfs(int u){
	int son=0;
	for(int i=head[u];i;i=e[i].nxt){
		++son;
	}
	for(int i=head[u];i;i=e[i].nxt){
		--son;
		int v=e[i].to;
		if(son==0){
			dfs(v);
		}
		else if(!leaf[v]){
			if(!can) can=1,++ans;
			dfs(v);
		}
		else{
			if(can) can--;
			else ++ans;
			dfs(v);
		}
	}
	can++;
}
int n;
inline void clr(){
	for(int i=1;i<=cnt;++i) e[i]={0,0};
	for(int i=1;i<=n;++i) head[i]=0;
	cnt=0;
	for(int i=1;i<=n;++i) leaf[i]=0,p[i]=0;
}
int main(){
	int T=read();
	while(T--){
		n=read();
		for(int i=1;i<=n;++i){
			p[i]=read();
			add(p[i],i);
			leaf[p[i]]=1;
		}
		ans=1;
		can=0;
		dfs(1);
		write(ans,'\n');
		clr();
	}
	return 0;
}