#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
constexpr int lim=6000005;
int rt[2000001],id=0;
int son[2000001],bro[2000001],sz[2000001],fa[2000001];
struct node
{
	int ls:25,rs:25,tag:21;
}tr[lim+1];
bitset<lim+1>val;
int fr[lim+1],tl=0;
int newnode()
{
	int rt;
	if(tl)rt=fr[--tl];
	else
	{
		rt=++id;
	}
	tr[rt].ls=tr[rt].rs=tr[rt].tag=0;
	val[rt]=0;
	return rt;
}
void pushdown(int rt,int dep)
{
	if(tr[rt].tag)
	{
		if(tr[rt].tag>>dep&1)
		{
			int t=tr[rt].ls;
			tr[rt].ls=tr[rt].rs;
			tr[rt].rs=t;
		}
		tr[tr[rt].ls].tag^=tr[rt].tag;
		tr[tr[rt].rs].tag^=tr[rt].tag;
		tr[rt].tag=0;
	}
}
void pushup(int rt)
{
	val[rt]=val[tr[rt].ls]&val[tr[rt].rs];
}
int insert(int rt,int vv,int dep)
{
	if(!rt)rt=newnode();
	pushdown(rt,dep);
	if(dep<0){val[rt]=1;return rt;}
	if(vv>>dep&1)tr[rt].rs=insert(tr[rt].rs,vv,dep-1);
	else tr[rt].ls=insert(tr[rt].ls,vv,dep-1);
	pushup(rt);
	return rt;
}
int merge(int x,int y,int dep)
{
	if(!x||!y){x|=y;return x;}
	if(dep<0)return x;
	pushdown(x,dep);
	pushdown(y,dep);
	tr[x].ls=merge(tr[x].ls,tr[y].ls,dep-1);
	tr[x].rs=merge(tr[x].rs,tr[y].rs,dep-1);
	fr[tl++]=y;
	pushup(x);
	return x;
}
int mex(int rt)
{
	int res=0;
	for(int x=20;x>=0;x--)
	{
		pushdown(rt,x);
		if(!val[tr[rt].ls])rt=tr[rt].ls;
		else rt=tr[rt].rs,res^=1<<x;
	}
	return res;
}
int sta[2000001],vv[2000001],g[2000001];
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	int T;
	cin>>T;
	int ans=0;
	while(T--)
	{
		int n;
		cin>>n;
		for(int x=1;x<=n;x++)
		son[x]=0,rt[x]=0,sz[x]=1,g[x]=0,vv[x]=0;
		tl=0;
		id=0;
		for(int x=2;x<=n;x++)
		{
			cin>>fa[x];
			bro[x]=son[fa[x]];
			son[fa[x]]=x;
		}
		for(int x=n;x>=1;x--)sz[fa[x]]+=sz[x];
		int ntl=0;
		sta[ntl++]=1;
		while(ntl>0)
		{
			int u=sta[ntl-1];
			if(vv[u])
			{
				rt[u]=insert(rt[u],g[u],20);
				int tag=mex(rt[u]);
				if(fa[u])
				{
					tr[rt[u]].tag^=g[fa[u]];
					tr[rt[fa[u]]].tag^=tag;
					g[fa[u]]^=tag;
					rt[fa[u]]=merge(rt[fa[u]],rt[u],20);
				}
				ntl--;
				continue;
			}
			vv[u]=1;
			int mxs=0;
			for(int v=son[u];v;v=bro[v])
			if(sz[v]>sz[mxs])mxs=v;
			for(int v=son[u];v;v=bro[v])
			if(v!=mxs)sta[ntl++]=v;
			sta[ntl++]=mxs;
		}
		ans^=mex(rt[1]);
	}
	cout<<ans<<endl;
}