from numpy import *
A=array(open(0).read().split(),int64)
N=A[0]
M=998244353
C=A[1:][:1<<N]
A=A[1:][1<<N:]
C=C.reshape((2,)*N)
for i in range(N):
  s=slice(None)
  t=(s,)*i+(0,)+(s,)*(N-i-1)
  u=(s,)*i+(1,)+(s,)*(N-i-1)
  C[t]+=C[u]
  C[u]=C[t]-C[u]*2
C=C.ravel()
print(sum(maximum(C*A[::2],C*A[1::2]))%M*pow((M+1)//2,int(N),M)%M)