#include<iostream>
#include<cstdio>
#include<bitset>
#include<cassert>
#define N 2000000
#define M 4000028
using namespace std;
const int w=21;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct node
{
	int v,nxt;
};
node edge[N+1];
int T,n,top,ans,len,head[N+1],length,fa[N+1],rt[N+1],dp[N+1],res[N+1],hs[N+1],st[N+1],leng,ztop,dque[M+1],lazy[M+1],sn[M+1][2],stk[N+1],tops;
bitset<M+1>vis;
void add(int x,int y)
{
	edge[++len]=(node){y,head[x]},head[x]=len;
	return;
}
void push_up(int k,int ds)
{
	if (ds==w) vis[k]=1;
	else vis[k]=vis[sn[k][0]]&vis[sn[k][1]];
	return;
}
void push_tag(int k,int d,int ds)
{
	if (ds==w) return;
	if ((d>>(w-1-ds))&1) swap(sn[k][0],sn[k][1]);
	lazy[k]^=d;
	return;
}
void spread(int k,int ds)
{
	if (lazy[k])
	{
		if (sn[k][0]) push_tag(sn[k][0],lazy[k],ds+1);
		if (sn[k][1]) push_tag(sn[k][1],lazy[k],ds+1);
		lazy[k]=0;
	}
	return;
}
void clear(int k)
{
	vis[k]=sn[k][0]=sn[k][1]=lazy[k]=0;
	return;
}
int new_node()
{
	int nw=ztop?dque[ztop--]:++length;
	assert(length<=M);
	clear(nw);
	return nw;
}
int merge(int x,int y,int ds)
{
	if (!x||!y) return x^y;
	if (ds==w)
	{
		vis[x]=vis[x]|vis[y];
		assert(ztop+1<=M),dque[++ztop]=y;
		return x;
	}
	spread(x,ds),spread(y,ds),sn[x][0]=merge(sn[x][0],sn[y][0],ds+1),sn[x][1]=merge(sn[x][1],sn[y][1],ds+1),push_up(x,ds),dque[++ztop]=y,assert(ztop+1<=M);
	return x;
}
int calc(int k,int ds)
{
	if (vis[k]) return 1<<(w-ds);
	if (ds==w) return 0;
	spread(k,ds);
	if (vis[sn[k][0]]) return (1<<(w-1-ds))+calc(sn[k][1],ds+1);
	else return calc(sn[k][0],ds+1);
}
int adder(int d)
{
	int k=new_node(),nw=k;
	for (int i=w-1;i>=0;--i) sn[k][(d>>i)&1]=new_node(),spread(k,19-i),k=sn[k][(d>>i)&1];
	vis[k]=1;
	return nw;
}
void bfs()
{
	int top;
	stk[tops=1]=1;
	while (tops)
	{
		top=stk[tops--],st[++leng]=top;
		if (hs[top])
		{
			stk[++tops]=hs[top];
			for (int i=head[top];i>0;i=edge[i].nxt)
				if (edge[i].v!=hs[top])
					stk[++tops]=edge[i].v;
		}
	}
	return;
}
int main()
{
	int top;
	bool op;
	T=read();
	while (T--)
	{
		n=read(),length=leng=ztop=len=0,op=1;
		for (int i=1;i<=n;++i) head[i]=hs[i]=rt[i]=res[i]=0,dp[i]=1;
		for (int i=2;i<=n;++i) fa[i]=read(),add(fa[i],i),op&=(fa[i]==i-1);
		for (int i=n;i>=2;--i)
		{
			if (dp[i]>dp[hs[fa[i]]]) hs[fa[i]]=i;
			dp[fa[i]]+=dp[i];
		}
		for (int i=1;i<=n;++i) dp[i]=0;
		bfs();
		for (int i=n;i>=1;--i)
		{
			top=st[i];
			if (!head[top]) rt[top]=adder(0),dp[top]=1;
			else dp[top]=calc(rt[top],0);
			if (fa[top])
			{
				if (hs[fa[top]]==top) rt[fa[top]]=adder(dp[top]),rt[fa[top]]=merge(rt[fa[top]],rt[top],0),res[fa[top]]^=dp[top];
				else push_tag(rt[fa[top]],dp[top],0),push_tag(rt[top],res[fa[top]],0),rt[fa[top]]=merge(rt[fa[top]],rt[top],0),res[fa[top]]^=dp[top];
			}
		}
		ans^=dp[1];
	}
	printf("%d\n",ans);
	return 0;
}