#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';

const int MOD = 998'244'353;
//need define int long long
int mod(int n) {
    n %= MOD;
    if (n < 0) return n + MOD;
    else return n;
}   
int fp(int a, int p) {
    int ans = 1, c = a;
    for (int i = 0; (1ll << i) <= p; ++i) {
        if ((p >> i) & 1) ans = mod(ans * c);
        c = mod(c * c);
    }   
    return ans;
}   
int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); }

struct M {
ll x;
M (int x_) {
    x = mod(x_);
}   
M () {
    x = 0;
}
M operator + (M y) {
    int ans = x + y.x;
    if (ans >= MOD)
        ans -= MOD;
    return M(ans);
}
M operator - (M y) {
    int ans = x - y.x;
    if (ans < 0)
        ans += MOD;
    return M(ans);            
}   
M operator * (M y) {
    return M(x * y.x % MOD);   
}   
M operator / (M y) {
    return M(x * fp(y.x, MOD - 2) % MOD);
}   
M operator + (int y) {
    return (*this) + M(y);
}
M operator - (int y) {
    return (*this) - M(y);
}   
M operator * (int y) {
    return (*this) * M(y);
}   
M operator / (int y) {
    return (*this) / M(y);
}   
M operator ^ (int p) {
    return M(fp(x, p));
}   
void operator += (M y) {
    *this = *this + y;
}   
void operator -= (M y) {
    *this = *this - y;
}   
void operator *= (M y) {
    *this = *this * y;
}
void operator /= (M y) {
    *this = *this / y;
}   
void operator += (int y) {
    *this = *this + y;
}   
void operator -= (int y) {
    *this = *this - y;
}   
void operator *= (int y) {
    *this = *this * y;
}
void operator /= (int y) {
    *this = *this / y;
}   
void operator ^= (int p) {
    *this = *this ^ p;
}
};  
const int N = 18;
M p[1 << N];
M sub[1 << N];

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cout.setf(ios::fixed); cout.precision(20); 
    #endif

    int n;
    cin >> n;
    vector <int> a(1 << n); 
    int s = 0;
    for (int i = 0; i < (1 << n); ++i) {
        cin >> a[i];
        s += a[i];
    }   
    for (int i = 0; i < (1 << n); ++i) {
        p[i] = M(a[i])/s;
        sub[i] = p[i];
    }   

    for (int b = 0; b < n; ++b)
        for (int i = 0; i < (1 << n); ++i)
            if ((i>>b) & 1) 
                sub[i] += sub[i - (1<<b)];

    auto f = [&] (int mask) {
        int oth = (1 << n) - 1 - mask;
        return sub[oth];
    };  

    auto sum = [&] (M a) {
        assert(a.x != 1);
        return a / (M(1) - a);
    };  

    /*
    for (int i = 1; i <= 100; ++i) {
        for (int j = 1; j <= 100; ++j) {
            M t = M(i)/M(j);
            if (t.x == 333333338) {
                cout << i << ' ' << j << endl;
                exit(0);
            }   
        }   
    }
    */  

    M ans(0);
    for (int mask = 1; mask < (1 << n); ++mask) {
        //cout << mask << ' ' << f(mask).x << ' ' << sum(f(mask)).x << endl;
        
        if (bp(mask)&1) {
            ans += sum(f(mask));
        }   
        else {
            ans -= sum(f(mask)); 
        }   
    }   
    cout << (ans+1).x << endl;
}