#include <bits/stdc++.h>

#define File(a) freopen(a ".in", "r", stdin), freopen(a ".out", "w", stdout)

const int Mod = 998244353, sgn[] = {1, Mod - 1};

int add(int a, int b) { return (a += b) >= Mod ? a - Mod : a; }
int sub(int a, int b) { return (a -= b) < 0 ? a + Mod : a; }
constexpr int pow(int a, int b, int ans = 1);

const int N = 1024, ivN = pow(N, Mod - 2);

void FWT(int *A, int lim = N);

int ful[N], now[N];
int popc[N];
int a[N], all;
int iv[N], piv[N];
int n;

int main() {
  scanf("%d", &n);
  for (int i = 0; i <= n; ++i) scanf("%d", a + i), all = add(all, a[i]);
  all = pow(all, Mod - 2);
  for (int i = 0; i <= n; ++i) a[i] = 1ll * a[i] * all % Mod;
  for (int i = 1; i < N; ++i) popc[i] = popc[i >> 1] + (i & 1);
  for (int i = 1; i <= n; ++i) ful[i] = a[i];
  FWT(ful);
  int ans = 0;
  for (int i = 1; i < N; ++i) {
    for (int j = 0; j < N; ++j) now[j] = (ful[j] + 1ll * a[i] * (Mod - sgn[popc[i & j] & 1])) % Mod;
    for (int j = 0; j < N; ++j) iv[j] = Mod + 1 - now[j];
    piv[0] = iv[0];
    for (int j = 1; j < N; ++j) piv[j] = 1ll * piv[j - 1] * iv[j] % Mod;
    int ivall = pow(piv[N - 1], Mod - 2);
    for (int j = N - 1; j > 0; --j) {
      int tmp = iv[j];
      iv[j] = 1ll * ivall * piv[j - 1] % Mod;
      ivall = 1ll * ivall * tmp % Mod;
    }
    iv[0] = ivall;
    int res = 0;
    for (int j = 0; j < N; ++j) res = (res + 1ll * iv[j] * sgn[popc[i & j] & 1]) % Mod;
    ans = (ans + res) % Mod;
  }
  ans = 1ll * ans * a[0] % Mod * ivN % Mod;
  printf("%d\n", ans);
  return 0;
}

void FWT(int *A, int lim) {
  for (int l = 1; l < lim; l <<= 1) {
    for (int i = 0; i < lim; i += (l << 1)) {
      for (int j = 0; j < l; ++j) {
        int x = A[i | j], y = A[i | j | l];
        A[i | j] = add(x, y), A[i | j | l] = sub(x, y);
      }
    }
  }
}

constexpr int pow(int a, int b, int ans) {
  while (b) {
    if (b & 1) ans = 1ll * ans * a % Mod;
    a = 1ll * a * a % Mod;
    b >>= 1;
  }
  return ans;
}