#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define pii pair<int, int>
#define fi first
#define se second
#define mkp make_pair
#define sz(x) (int)x.size()
using namespace std;
bool Med;

LL read() {
	LL s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

const int MAXN = 2e6 + 5;

int n;
int to[MAXN], nxt[MAXN], head[MAXN], tot = 0;
int sz[MAXN];

void init(int n) {
	tot = 0;
	for (int i = 1; i <= n; i++) head[i] = 0;
}

void add(int u, int v) {
	to[++tot] = v, nxt[tot] = head[u], head[u] = tot;
}

void pre() {
	for (int i = n; i; i--) {
		sz[i] = 1;
		for (int j = head[i]; j; j = nxt[j])
			sz[i] += sz[to[j]];
	}
}

int mx = 0;

namespace Trie {
	const int SZ = 4000000;
	bitset<SZ + 5> in;
	int nxt[SZ + 5][2], sz[SZ + 5], bin[SZ + 5], tag[SZ + 5], cnt = 0, rt[MAXN];
	void init() { cnt = 0; for (int i = 1; i <= SZ; i++) bin[++cnt] = i, in[i] = 0;}
	void clr(int x) {
		if (!in[x]) return ;
		bin[++cnt] = x, sz[x] = nxt[x][0] = nxt[x][1] = 0, tag[x] = 0;
		in[x] = 0;
	}
	int New_Node() {
		int p = bin[cnt--];
		mx = max(mx, SZ - cnt);
		return in[p] = 1, p;
	}
	void pushtag(int x, int d) {
		if ((tag[x] >> d) & 1) swap(nxt[x][0], nxt[x][1]), tag[x] ^= (1 << d);
		if (nxt[x][0]) tag[nxt[x][0]] ^= tag[x];
		if (nxt[x][1]) tag[nxt[x][1]] ^= tag[x];
		tag[x] = 0;
	}
	void insert(int p, int x) {
		bool ok = 0;
		if (!rt[p]) rt[p] = New_Node(), ok = 1;
		int cur = rt[p];
		for (int i = 20; i >= 0; i--) {
			int o = (x >> i) & 1; pushtag(cur, i);
			if (!nxt[cur][o]) nxt[cur][o] = New_Node(), ok = 1;
			cur = nxt[cur][o];
		}
		if (ok) {
			cur = rt[p];
			for (int i = 20; i >= 0; i--)
				cur = nxt[cur][(x >> i) & 1], sz[cur]++;
		}
	}
	int merge(int x, int y, int d) {
		if (!x || !y) return x + y;
		if (d == -1) return clr(y), x;
		pushtag(x, d), pushtag(y, d);
		nxt[x][0] = merge(nxt[x][0], nxt[y][0], d - 1), nxt[x][1] = merge(nxt[x][1], nxt[y][1], d - 1);
		sz[x] = sz[nxt[x][0]] + sz[nxt[x][1]];
		return clr(y), x;
	}
	void addtag(int x, int v) { tag[rt[x]] ^= v;}
	void merge(int x, int y) { rt[x] = merge(rt[x], rt[y], 20), rt[y] = 0;}
	int qry(int x) {
		int cur = rt[x], ans = 0;
		for (int i = 20; i >= 0; i--) {
			pushtag(cur, i);
			if (sz[nxt[cur][0]] == (1 << i)) cur = nxt[cur][1], ans += (1 << i);
			else cur = nxt[cur][0];
		}
		return ans;
	}
	void clear(int x) {
		// cout << x << endl;
		if (!x) return ;
		clear(nxt[x][0]), clear(nxt[x][1]);
		clr(x);
	}
}

inline int dfs2(int x) {
	if (!head[x]) return Trie::insert(x, 0), 1;
	int son = 0;
	for (int i = head[x]; i; i = nxt[i])
		if (sz[to[i]] > sz[son]) son = to[i];
	int sum = dfs2(son);
	Trie::rt[x] = Trie::rt[son], Trie::addtag(x, sum);
	for (int i = head[x]; i; i = nxt[i]) {
		int y = to[i];
		if (y == son) continue;
		int val = dfs2(y);
		Trie::addtag(y, val), sum ^= val, Trie::merge(x, y);
	}
	Trie::insert(x, 0), Trie::addtag(x, sum);
	return Trie::qry(x);
}

inline int work() {
	n = read(), init(n);
	for (int i = 2; i <= n; i++) add(read(), i);
	pre();
	int ans = dfs2(1);
	for (int i = 1; i <= n; i++) Trie::clear(Trie::rt[i]), Trie::rt[i] = 0;
	return ans;
}

bool Mst;
signed main() {
	Trie::init();
	// freopen("game19.in", "r", stdin);
	fprintf(stderr, "%.2lfMB\n", (&Med - &Mst) / 1048576.0);
	int T = read(), ans = 0;
	while (T--) ans ^= work();
	printf("%d\n", ans);
	cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	cerr << mx << endl;
	return 0;
}