#include <bits/stdc++.h>
using namespace std;
const int N=2e6+10;

struct edg{
	int to,nxt;
}edge[N];

int cnt,head[N];

void add(int u,int v) {
	edge[++cnt]={v,head[u]},head[u]=cnt;
}

int T;
int n;
int siz[N],son[N];
int ans;

struct Node{
	int ch[2];
	int siz;
	int tag;
	#define ch(x) t[x].ch
	#define siz(x) t[x].siz
	#define tag(x) t[x].tag
}t[N<<1];

int tot;
int stk[N<<1],top;
int rt[N];

int New() {
	int id;
	if(top>0) id=stk[top--];
	else id=++tot;
	t[id]={{0,0},0,0};
	return id;
}

void pushup(int id) {
	siz(id)=siz(ch(id)[0])+siz(ch(id)[1]);
}

void pushdown(int id,int k) {
	if(tag(id)) {
		if(tag(id)>>k&1) swap(ch(id)[0],ch(id)[1]);
		if(ch(id)[0]) tag(ch(id)[0])^=tag(id);
		if(ch(id)[1]) tag(ch(id)[1])^=tag(id);
		tag(id)=0;
	}
}

void ins(int p,int val) {
	int pp=p;
	bool flag=0;
	for(int i=20;i>=0;i--) {
		pushdown(p,i);
		int v=val>>i&1;
		if(!ch(p)[v]) {
			flag=1;
			break;
		}
		p=ch(p)[v];
	}
	if(!flag) return ;
	p=pp;
	siz(p)++;
	for(int i=20;i>=0;i--) {
		int v=val>>i&1;
		if(!ch(p)[v]) ch(p)[v]=New();
		p=ch(p)[v];
		siz(p)++;
	}
}

int mg(int p,int q,int k) {
	if(!p || !q) return p|q;
	pushdown(p,k);
	pushdown(q,k);
	ch(p)[0]=mg(ch(p)[0],ch(q)[0],k-1);
	ch(p)[1]=mg(ch(p)[1],ch(q)[1],k-1);
	stk[++top]=q;
	if(k) pushup(p);
	return p;
}

int query(int p,int k) {
	if(!p) return 0;
	if(siz(p)==1<<k+1) return 1<<k+1;
	pushdown(p,k);
	if(siz(ch(p)[0])==1<<k) return (1<<k)+query(ch(p)[1],k-1);
	else return query(ch(p)[0],k-1);
}

void dfs1(int u) {
	siz[u]=1;
	son[u]=0;
	for(int i=head[u];i;i=edge[i].nxt) {
		int v=edge[i].to;
		dfs1(v);
		if(siz[v]>siz[son[u]]) son[u]=v;
		siz[u]+=siz[v];
	}
}

int dfs2(int u) {
	int xr=0;
	if(son[u]) {
		xr^=dfs2(son[u]);
		rt[u]=rt[son[u]];
		for(int i=head[u];i;i=edge[i].nxt) {
			int v=edge[i].to;
			if(v==son[u]) continue;
			xr^=dfs2(v);
			rt[u]=mg(rt[u],rt[v],20);
		}
	}
	else rt[u]=New();
	ins(rt[u],0);
	tag(rt[u])^xr;
	int res=query(rt[u],20);
	tag(rt[u])^=res;
	return res;
}

int main() {
	scanf("%d",&T);
	while(T--) {
		scanf("%d",&n);
		cnt=0;
		for(int i=1;i<=n;i++) head[i]=0;
		for(int i=2;i<=n;i++) {
			int p;
			scanf("%d",&p);
			add(p,i);
		}
		dfs1(1);
		tot=0,top=0;
		ans^=dfs2(1);
	}
	printf("%d",ans);
	return 0;
}