#include <iostream>

using namespace std;
typedef long long ll;
ll mod = 998244353,a[300010],b[300010],sum = 0;
ll pw(ll a,ll x){
    a %= mod;
    ll ret = 1;
    while(x){
        if(x&1) (ret *= a) %= mod;
        x /= 2; (a *= a) %= mod;
    }
    return ret;
}

int main(){
    int i,j,n; cin >> n;
    if(n>18) exit(1);
    for(i=0;i<(1<<n);i++) cin >> a[i];
    for(i=0;i<(1<<n);i++){
        b[i] = a[i]; (sum += a[i]) %= mod;
    }
    for(j=0;j<n;j++){
        for(i=0;i<(1<<n);i++){
            if(i & (1<<j)) (a[i] += a[i^(1<<j)]) %= mod;
        }
    }
    sum = pw(sum,mod - 2);
    for(i=0;i<(1<<n);i++) a[i] = pw((mod + 1 - a[i]*sum%mod),2*mod - 4);
    for(j=0;j<n;j++){
        for(i=0;i<(1<<n);i++){
            if(i & (1<<j)) (a[i] += (mod - 1)*a[i^(1<<j)]%mod) %= mod;
        }
    }
    for(j=0;j<n;j++){
        for(i=0;i<(1<<n);i++){
            if(i & (1<<j)) (b[i^(1<<j)] += b[i]) %= mod;
        }
    }
    for(i=0;i<(1<<n);i++) (b[i] *= sum) %= mod;
    ll ans = 0;
    for(i=0;i<(1<<n) - 1;i++) (ans += b[i^((1<<n) - 1)]*a[i]%mod) %= mod;
    cout << ans << endl;
}