#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e6 + 5;

int ans, K;
vector<int> g[maxn];
int siz[maxn], son[maxn];
int sg[maxn], rt[maxn];

void dfs(int u)
{
	siz[u] = 1, son[u] = 0;
	for (int v : g[u])
	{
		dfs(v), siz[u] += siz[v];
		if (siz[v] > siz[son[u]]) son[u] = v;
	}
}

struct trie
{
	struct trinode
	{
		int ls, rs;
		int siz, dep, lz;
	}t[maxn << 1];
	int cnt;
	int stk[maxn << 1], tp;
	
	inline int newnod(int d)
	{
		int x = tp ? stk[tp--] : ++cnt;
		t[x].dep = d; return x;
	}
	inline void recycle(int x)
	{
		stk[++tp] = x;
		t[x].ls = t[x].rs = t[x].siz = t[x].dep = t[x].lz = 0;
	}
	
	inline void pushup(int k) { t[k].siz = t[t[k].ls].siz + t[t[k].rs].siz; }
	inline void upd(int k, int d) { t[k].lz ^= d; if (t[k].dep && ((d >> (t[k].dep - 1)) & 1)) swap(t[k].ls, t[k].rs); }
	inline void pushdown(int k) { if (t[k].lz) upd(t[k].ls, t[k].lz), upd(t[k].rs, t[k].lz), t[k].lz = 0; }
	
	int query(int k, int dep)
	{
		if (!k || !dep) return 0;
		pushdown(k);
		if (t[t[k].ls].siz == (1 << (dep - 1))) return (1 << (dep - 1)) + query(t[k].rs, dep - 1);
		else return query(t[k].ls, dep - 1);
	}
	
	int merge(int a, int b, int dep)
	{
		if (!a || !b) return a ^ b;
		if (!dep)
		{
			t[a].siz |= t[b].siz;
			recycle(b); return a;
		}
		pushdown(a), pushdown(b);
		t[a].ls = merge(t[a].ls, t[b].ls, dep - 1);
		t[a].rs = merge(t[a].rs, t[b].rs, dep - 1);
		recycle(b); pushup(a); return a;
	}
	
	void insert(int &k, int dep, int x)
	{
		if (!k) k = newnod(dep);
		if (!dep) return t[k].siz = 1, void();
		pushdown(k);
		if ((x >> (dep - 1)) & 1) insert(t[k].rs, dep - 1, x);
		else insert(t[k].ls, dep - 1, x);
		pushup(k);
	}
	
	void travel(int k, int dep, int x)
	{
		if (!k) return; if (!dep) return cout << x << " ", void();
		pushdown(k);
		travel(t[k].ls, dep - 1, x), travel(t[k].rs, dep - 1, x | (1 << (dep - 1)));
	}
}T;

void dfs2(int u)
{
	int sum = 0; rt[u] = 0;
	if (son[u])
	{
		dfs2(son[u]), sum ^= sg[son[u]];
		rt[u] = rt[son[u]];
	}
	for (int v : g[u])
		if (v != son[u])
		{
			dfs2(v), T.upd(rt[u], sg[v]), T.upd(rt[v], sum);
			sum ^= sg[v], rt[u] = T.merge(rt[u], rt[v], K);
		}
	T.insert(rt[u], K, sum);
	sg[u] = T.query(rt[u], K);
}

void work()
{
	int n; cin >> n; T.cnt = T.tp = K = 0;
	while ((1 << K) <= n) K++;
	for (int i = 1; i <= n; i++) g[i].clear();
	for (int i = 2; i <= n; i++)
	{
		int x; cin >> x;
		g[x].emplace_back(i);
	}
	dfs(1), dfs2(1), ans ^= sg[1];
	for (int i = 1; i <= T.cnt; i++) T.recycle(i);
}

int main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	
	int T; cin >> T;
	while (T--) work();
	cout << ans;
	return 0;
}