// created:  2024-08-21 09:29:39
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef unsigned long long ull;
constexpr int N=8,N6=1679616,NN=1<<8,MOD=998244353,BP=0x55555555;
void reduce(int &x){(x>=MOD)&&(x-=MOD);}
void reduce_(int &x){(x<0)&&(x+=MOD);}
int qpow(ull a,int b,ull c=1)
{
	for(;b;b>>=1,(a*=a)%=MOD)if(b&1)(c*=a)%=MOD;
	return (int)c;
}
struct s3e
{
	int m00,m01,m10,m11,par,id;
	constexpr friend s3e operator*(const s3e &u,const s3e &v)
	{
		return {(int)(((ull)u.m00*v.m00+(ull)u.m01*v.m10)%MOD),(int)(((ull)u.m00*v.m01+(ull)u.m01*v.m11)%MOD),
				(int)(((ull)u.m10*v.m00+(ull)u.m11*v.m10)%MOD),(int)(((ull)u.m10*v.m01+(ull)u.m11*v.m11)%MOD),
				(int)((ull)u.par*v.par%MOD),(int)((ull)u.id*v.id%MOD)};
	}
};
constexpr s3e s3id={1,0,0,1,1,1},s3r={0,1,MOD-1,MOD-1,1,1},s3f={0,1,1,0,MOD-1,1};
constexpr s3e s3[6]={s3id,s3f,s3f*s3r,s3r,s3r*s3r,s3r*s3f};
int tr[6][6],itr[6][6];
void init()
{
	static int a[6][6];
	F(i,0,6)memcpy(tr[i],&s3[i],sizeof(int)*6),itr[i][i]=1;
	F(i,0,6)F(j,0,i)swap(tr[i][j],tr[j][i]);
	memcpy(a,tr,sizeof tr);
	F(i,0,6)
	{
		if(!a[i][i])F(j,i+1,6)if(a[j][i])swap(a[i],a[j]),swap(itr[i],itr[j]);
		int iv=qpow(a[i][i],MOD-2);
		F(j,i,6)a[i][j]=(int)((ull)iv*a[i][j]%MOD);
		F(j,0,6)itr[i][j]=(int)((ull)iv*itr[i][j]%MOD);
		F(j,0,6)if(j!=i)
		{
			int c=MOD-a[j][i];
			F(k,i,6)a[j][k]=(int)((a[j][k]+(ull)c*a[i][k])%MOD);
			F(k,0,6)itr[j][k]=(int)((itr[j][k]+(ull)c*itr[i][k])%MOD);
		}
	}
}
int n,n6,a[N6],p6[N+1],b[NN][NN],w[N],sw[NN],ib[NN][NN];
ull aa[N6];
int main()
{
	init();
	read(n);
	F(i,p6[0]=1,n+1)p6[i]=p6[i-1]*6;
	n6=p6[n];
	int sa=1;
	F(i,0,n6)reduce(sa+=read(a[i]));
	int isa=qpow(sa,MOD-2);
	F(i,0,n6)a[i]=(int)((ull)isa*a[i]%MOD);
	for(int i=1;i<n6;i*=6)
	{
		for(int j=0;j<n6;j+=6*i)F(x,0,6)F(y,0,6)F(k,j,j+i)aa[x*i+k]+=(ull)tr[x][y]*a[y*i+k];
		F(j,0,n6)a[j]=(int)(aa[j]%MOD),aa[j]=0;
	}
	F(i,0,1<<(2*n))if(!((~i>>1&i)&BP))
	{
		int sh=0,d=0;
		F(j,0,n)
		{
			int t=i>>(2*j)&3;
			if(t)sh+=p6[j]*(t+2);
			else w[d++]=p6[j];
		}
		reverse(w,w+d);
		F(j,1,1<<d)sw[j]=sw[j^(j&-j)]+w[__builtin_ctz(j)];
		F(x,0,1<<d)F(y,0,1<<d)b[x][y]=a[sh+2*sw[x]+sw[y]],b[x][y]&&(b[x][y]=MOD-b[x][y]);
		F(x,0,1<<d)reduce(++b[x][x]);
		F(x,0,1<<d)memset(ib[x],0,sizeof(int)<<d),ib[x][x]=1;
		F(x,0,1<<d)
		{
			if(!b[x][x])F(y,x+1,1<<d)if(b[y][x])swap(b[x],b[y]),swap(ib[x],ib[y]);
			if(!b[x][x])return puts("-1"),0;
			int iv=qpow(b[x][x],MOD-2);
			F(y,x,1<<d)b[x][y]=(int)((ull)iv*b[x][y]%MOD);
			F(y,0,1<<d)ib[x][y]=(int)((ull)iv*ib[x][y]%MOD);
			F(y,0,1<<d)if(y!=x)
			{
				int c=MOD-b[y][x];
				F(z,x,1<<d)b[y][z]=(int)((b[y][z]+(ull)c*b[x][z])%MOD);
				F(z,0,1<<d)ib[y][z]=(int)((ib[y][z]+(ull)c*ib[x][z])%MOD);
			}
		}
		F(x,0,1<<d)F(y,0,1<<d)a[sh+2*sw[x]+sw[y]]=ib[x][y];
	}
	for(int i=1;i<n6;i*=6)
	{
		for(int j=0;j<n6;j+=6*i)F(x,0,6)F(y,0,6)F(k,j,j+i)aa[x*i+k]+=(ull)itr[x][y]*a[y*i+k];
		F(j,0,n6)a[j]=(int)(aa[j]%MOD),aa[j]=0;
	}
	F(i,0,n6)a[i]=(int)((ull)isa*a[i]%MOD);
	int ans=0;
	F(i,0,n6)ans^=a[i];
	printf("%d\n",ans);
	return 0;
}