#include<bits/stdc++.h>
#define int long long
using namespace std;
int Read(){
	int x=0;
	char ch=getchar();bool f=0;
	while(ch<'0'||ch>'9') if(ch=='-')f=1,ch=getchar(); else if(ch==EOF)return 0; else ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return f?-x:x;
}
int h[200005];
int nxt[200005];
int to[200005];
int cnt;
int s[200005];
void link(int x,int y){
	nxt[++cnt]=h[x];
	h[x]=cnt;
	to[cnt]=y;
	s[x]++;
	return;
}
queue<int> q;
int ans;
void dfs(int x,int fa){
	if((!(q.size()==1&&q.front()==fa))&&(!q.empty())){
		int p=q.front();q.pop();
		if(p==fa){
			q.push(p);q.pop();
		}
	}else ans++;
//	cout<<x<<' '<<ans<<endl;
	if(!h[x]) q.push(x);
	for(int i=h[x];i;i=nxt[i]){
		if(!nxt[i]) q.push(x);
		dfs(to[i],x);
	}
	return;
}
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	int T=Read();
	while(T--){
		int n=Read();
		ans=0;
		for(int i=1;i<=n;i++){
			int x=Read();
			link(x,i);
		}q.push(0);
		dfs(1,0);
		printf("%lld\n",ans);
		for(int i=0;i<=n;i++) h[i]=0;
		while(!q.empty())q.pop();
	}
	return 0; 
}