#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, int> P;
const ll MOD=998244353;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
int main()
{
    int n; cin>>n;
    vector<ll> a(1<<n);
    ll s=0;
    for(int i=0; i<(1<<n); i++){
        cin>>a[i];
        s+=a[i];
    }
    s%=MOD;
    ll is=inv(s);
    for(int i=0; i<(1<<n); i++){
        a[i]=a[i]*is%MOD;
    }
    for(int i=0; i<n; i++){
        for(int j=0; j<(1<<n); j++){
            if(j&(1<<i)){
                a[j]+=a[j^(1<<i)];
                if(a[j]>=MOD) a[j]-=MOD;
            }
        }
    }
    ll ans=0;
    for(int i=0; i<(1<<n)-1; i++){
        ll r=inv((1-a[i]+MOD)%MOD);
        if((n-popcount(i)-1)&1){
            ans+=MOD-r;
        }else{
            ans+=r;
        }
        if(ans>=MOD) ans-=MOD;
    }
    cout<<ans<<endl;
    return 0;
}