#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define db double
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>

using namespace std;


int m,n[100005],a[10005][505]; 
int nxt[1000005],pre[1000005],h[100005],w[100005]; 
struct node {
	int id,x; 
} b[5000005];     
void del(int y,int x) {
	if (h[y]==x) {
		h[y]=nxt[x]; 
	}
	int pr=pre[x],nx=nxt[x];
	if (pr) nxt[pr]=nx;
	if (nx) pre[nx]=pr; 
	pre[x]=nxt[x]=0; 
}                          
void ins(int x,int y) {
	pre[h[x]]=y;
	nxt[y]=h[x];
	h[x]=y;
	pre[y]=0;
}       
int val[10005]; 
int ans[10005],rk[10005]; 
int x[10005]; 

int main() {
	scanf("%d",&m);
	for (int i=0;i<=1000;i++) h[i]=m+i+1;
	int cnt=0; 
	for (int i=1;i<=m;i++) {
		scanf("%d",&n[i]); 
		for (int j=1;j<=n[i];j++) {
			int t; 
			scanf("%d",&t);
			x[j]=t; 
			cnt++;
			b[cnt].id=i,b[cnt].x=t; 
		}
		sort(x+1,x+n[i]+1);
		ans[i]^=(i+i+x[(n[i]+1)/2]); 
	}
	sort(b+1,b+cnt+1,[&](node x,node y){
		return x.x==y.x?x.id<y.id:x.x<y.x;
	}); 
	for (int i=1;i<=m;i++) {
		w[i]=n[i];
		ins(w[i]+500,i);
	}
	for (int i=1;i<=cnt;i++) {
		int pos=b[i].id; 
		del(w[pos]+500,pos);
		w[pos]-=2;
		ins(w[pos]+500,pos);
		int x=-w[pos]+500;
		for (int p=h[x];p<=m;p=nxt[p]){
			if (p==pos) continue ; 
			ans[p]^=(p+pos+b[i].x); 
		    ans[pos]^=(p+pos+b[i].x); 
		}
		x--; 
		for (int p=h[x];p<=m;p=nxt[p]){
			if (p==pos) continue ; 
			ans[p]^=(p+pos+b[i].x); 
			ans[pos]^=(p+pos+b[i].x); 
		}
	}
	for (int i=1;i<=m;i++) {
		printf("%d\n",ans[i]); 
	}
	return 0;
}