#include <bits/extc++.h>

using namespace std;

template <class T, class Op = multiplies<>>
constexpr T power(T a, uint64_t n, T init = 1, Op op = Op{}) {
  while (n) {
    if (n & 1) init = op(init, a);
    if (n >>= 1) a = op(a, a);
  }
  return init;
}

template <uint32_t M>
struct modular {
  using T = modular;
  static constexpr uint32_t mod = M;
  uint32_t v;
  modular(int64_t x = 0) : v((x %= mod) < 0 ? x + mod : x) {}
  T operator-() const { return T() -= *this; }
  T& operator+=(T b) { return (int)(v += b.v - mod) < 0 ? v += mod : v, *this; }
  T& operator-=(T b) { return (int)(v -= b.v) < 0 ? v += mod : v, *this; }
  T& operator*=(T b) { return v = (uint64_t)v * b.v % mod, *this; }
  T& operator/=(T b) { return *this *= power(b, mod - 2); }
  friend T operator+(T a, T b) { return a += b; }
  friend T operator-(T a, T b) { return a -= b; }
  friend T operator*(T a, T b) { return a *= b; }
  friend T operator/(T a, T b) { return a /= b; }
  friend bool operator==(T a, T b) { return a.v == b.v; }
};

using mint = modular<998244353>;

int main() {
  int n;
  cin >> n;
  assert(1 <= n), assert(n <= 18);
  vector<int> a(1 << n);
  for (auto&& e : a) {
    cin >> e;
    assert(1 <= e), assert(e <= 1000);
  }

  vector<mint> p(1 << n);
  mint sum_a = accumulate(begin(a), end(a), 0);
  for (int i = 0; i < 1 << n; ++i) p[i] = a[i] / sum_a;

  for (int s = 0; s < n; ++s)
    for (int i = 0; i < 1 << n; ++i)
      if (i >> s & 1) p[i] += p[i ^ 1 << s];

  mint res;
  for (int i = 1; i < 1 << n; ++i)
    res += (__builtin_parity(i) ? +1 : -1) / (1 - p[~i & ((1 << n) - 1)]);
  cout << res.v << '\n';
}