#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned uint;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
bool mmp1;
char Buf[1<<16],*P1=Buf,*P2=Buf;
#define getchar() (P1==P2&&(P2=(P1=Buf)+fread(Buf,1,1<<16,stdin),P1==P2)?EOF:*P1++)
template<typename type>
inline void read(type &x)
{
	x=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')
		ch=getchar();
	while(ch>='0'&&ch<='9')
		x=x*10+(ch^48),ch=getchar();
}
constexpr int Max=2e6+10,Size=4e6+100,lim=20;
struct int23_array
{
	struct reference
	{
		int23_array *p;
		int i;
		inline reference(int23_array *p,int i):p(p),i(i){}
		inline operator int()const
		{
			return p->test(i);
		}
		inline reference &operator =(const int &k)
		{
			p->set(i,k);
			return *this;
		}
		inline reference &operator =(reference k)
		{
			p->set(i,(int)k);
			return *this;
		}
		inline friend void swap(reference x,reference y)
		{
			int tmp=(int)x;
			x=(int)y;
			y=tmp;
		}
	};
	static constexpr int U=(1<<23)-1;
	ull *a;
	int23_array(int len)
	{
		int Size=len*23/64+3;
		a=new ull[Size];
		fill(a,a+Size,0);
	}
	inline reference operator [](int i)
	{
		return reference(this,i);
	}
	inline int test(const int &i)const
	{
		int x=i*23;
		int u=x>>6,v=x&63;
		if(v<=41)
			return a[u]>>v&U;
		else
		{
			int p=64-v,q=v-41;
			return a[u]>>v|((a[u+1]&((1<<q)-1))<<p);
		}
	}
	inline void set(const int &i,const int &k)
	{
		int x=i*23;
		int u=x>>6,v=x&63;
		if(v<=41)
			a[u]+=(k-(a[u]>>v&U))<<v;
		else
		{

			int p=64-v,q=v-41;
			a[u]+=((k&((1<<p)-1))-(a[u]>>v))<<v;
			a[u+1]+=(k>>p)-(a[u+1]&((1<<q)-1));
		}
	}
};
int23_array ls(Size),rs(Size),tag(Size);
// int ls[Size],rs[Size],tag[Size];
#define ls(p) ls[p]
#define rs(p) rs[p]
bitset<Size>s;
stack<int>stk;
int node_cnt;
inline int new_node()
{
	int p;
	if(!stk.empty())
		p=stk.top(),stk.pop();
	else
		p=++node_cnt;
	return p;
}
inline void push_up(int p)
{
	s.set(p,s.test(ls(p))&&s.test(rs(p)));
}
inline void set_tag(int p,int d,const int &k)
{
	if(k>>d&1)
		swap(ls(p),rs(p));
	tag[p]=(int)tag[p]^k;
}
inline void push_down(int p,int d)
{
	if(tag[p])
	{
		if(ls(p))
			set_tag(ls(p),d-1,tag[p]);
		if(rs(p))
			set_tag(rs(p),d-1,tag[p]);
		tag[p]=0;
	}
}
inline void clear(int p)
{
	ls(p)=0,rs(p)=0,tag[p]=0;
	s.reset(p);
	stk.push(p);
}
int query(int p,int d)
{
	if(!p||!~d)
		return 0;
	push_down(p,d);
	if(s.test(ls(p)))
		return (1<<d)+query((int)rs(p),d-1);
	else
		return query((int)ls(p),d-1);
}
void insert(int23_array::reference p,int d,const int &k)
{
	if(!p)
		p=new_node();
	if(!~d)
	{
		s.set(p);
		return;
	}
	push_down(p,d);
	insert(k>>d&1?rs(p):ls(p),d-1,k);
	push_up(p);
}
int T=0;
int merge(int p,int q,int d)
{
	if(!p||!q)
		return p|q;
	if(!~d)
	{
		clear(q);
		return p;
	}
	push_down(p,d);
	push_down(q,d);
	ls(p)=merge(ls(p),ls(q),d-1);
	rs(p)=merge(rs(p),rs(q),d-1);
	push_up(p);
	clear(q);
	return p;
}
int n;
int23_array fa(Max),sum(Max),head(Max),nxt(Max),rt(Max),son(Max),siz(Max);
// int fa[Max],sum[Max],head[Max],nxt[Max],rt[Max],son[Max],siz[Max];
inline void add_edge(int u,int v)
{
	nxt[v]=(int)head[u],head[u]=v;
}
void update(int u)
{
	insert(rt[u],lim,0);
	set_tag(rt[u],lim,sum[u]);
	sum[u]=query(rt[u],lim);
	int v=fa[u];
	if(v)
	{
		sum[v]=sum[v]^sum[u];
		set_tag(rt[u],lim,sum[u]);
		rt[v]=merge(rt[v],rt[u],lim);
	}
}
int solve()
{
	read(n);
	for(int i=2,x;i<=n;++i)
		read(x),fa[i]=x;
	for(int i=1;i<=n;++i)
		siz[i]=1,son[i]=0,head[i]=0,nxt[i]=0,rt[i]=0,sum[i]=0;
	for(int i=n;i>1;--i)
	{
		int j=fa[i];
		siz[j]=siz[j]+siz[i];
		if(siz[i]>siz[son[j]])
			son[j]=i;
	}
	for(int i=2;i<=n;++i)
		if(son[fa[i]]!=i)
			add_edge(fa[i],i);
	for(int i=1;i<=n;++i)
		if(son[i])
			add_edge(i,son[i]);
	stack<int>stk;
	stk.push(1);
	while(!stk.empty())
	{
		int u=stk.top();
		if(head[u])
		{
			int v=head[u];
			head[u]=nxt[v];
			stk.push(v);
		}
		else
		{
			stk.pop();
			update(u);
		}
	}
	return sum[1];
}
void clear()
{
	while(!stk.empty())
		stk.pop();
	for(int i=1;i<=node_cnt;++i)
		s.reset(i),ls(i)=0,rs(i)=0,tag[i]=0;
	node_cnt=0;
}
bool mmp2;
signed main()
{
	cerr<<(&mmp1-&mmp2)/1048576.0<<"\n";
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	int t,ans=0;
	read(t);
	while(t--)
	{
		ans^=solve();
		clear();
	}
	cout<<ans<<"\n";
	return 0;
}