#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
#define int ll
#define N 5005
using namespace std;
int n,a[2000005],f[N][N];
inline ll quickPower(ll x,ll y)
{
	ll res=1;
	while (y)
	{
		if (y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return res;
}
void BellaKira()
{
	cin>>n;
	n=(1<<n);
	int sm=0;
	bool bl=1;
	for (int i=1;i<n;i++)
		cin>>a[i],sm=(sm+a[i])%mod,bl&=(a[i]==a[1]);
	if (bl)
	{
		cout<<quickPower((a[1]*n+1)%mod,n-1)<<'\n';
		return;
	}
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=n;j++)
		{
			if (i==j)
			{
				f[i][i]=(sm+1)%mod;
			} else
			{
				f[i][j]=(mod-a[(i-j+n)%n])%mod;
			}
		}
	}
	
		
	int ans=1;
	for (int i=1;i<=n;i++)
	{
		for (int j=i+1;j<=n;j++)
		{
			while (f[i][i])
			{
				int s=f[j][i]/f[i][i];
        		for(int k=i;k<=n;++k)
				{
        		    f[j][k]=(f[j][k]-1ll*s*f[i][k]%mod+mod)%mod;
        		}
        		swap(f[i],f[j]);
        		ans=mod-ans;
    		}
    		swap(f[i],f[j]);
        	ans=mod-ans;
		}
		// cout<<i<<" "<<f[i][i]<<endl;
	}
	for (int i=1;i<=n;i++)
		ans=ans*f[i][i]%mod;
	cout<<ans<<'\n';
	
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}