#include <bits/stdc++.h>
#include <atomic>
using namespace std;

typedef long long ll;
const ll mod = 998244353;

ll f[405][405], p[405], g[405][405], h[405][405];
ll inv[405], fac[405], a[405], sum[405];

void precalc(int x)
{
    fac[0] = fac[1] = inv[0] = inv[1] = 1;
    for (int i = 2; i <= x; i++)
    {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = inv[mod % i] * (mod - mod / i) % mod;
    }
    for (int i = 2; i <= x; i++) inv[i] = inv[i] * inv[i - 1] % mod;
}

ll fpow(ll a, ll b)
{
    ll ans = 1;
    while (b)
    {
        if (b & 1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}
ll C(int n, int m) { return n < m ? 0 : fac[n] * inv[m] % mod * inv[n - m] % mod; }

int main()
{
    precalc(400);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sum[0] = 1;
    for (int i = 1; i <= n; i++)
        for (int j = i; j; j--)
            (sum[j] += sum[j - 1] * a[i] % mod) %= mod;
    g[1][1] = h[1][1] = p[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        for (int j = 2; j <= i; j++)
            for (int k = 1; k < i; k++)
            {
                (h[i][j] += h[i - k][j - 1] * h[k][1] % mod * C(i - 1, k - 1)) %= mod;
                (g[i][j] += g[i - k][j - 1] * g[k][1] % mod * C(i - 1, k - 1)) %= mod;
            }
        g[i][1] = fpow(2, i * (i - 1) / 2);
        for (int j = 2; j <= i; j++)
            (g[i][1] += mod - g[i][j]) %= mod;
        h[i][1] = g[i][1] * i % mod;

        p[i] = g[i][1];
        for (int k = 1; k < i; k++)
            for (int j = 1; j <= i - k; j++)
                (p[i] += mod - p[k] * fpow(k, j) % mod * h[i - k][j] % mod * C(i - 1, k - 1) % mod) %= mod;
    }
    f[0][0] = 1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= n; j++)
            for (int k = 1; k <= n - j; k++)
                (f[i][j + k] += f[i - 1][j] * p[k] % mod * k % mod * k % mod * C(j + k - 1, k - 1)) %= mod;
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        ll tmp = f[i][n] * fpow(C(n, i), mod - 2) % mod * sum[i] % mod * fpow(n, (i - 2 + mod - 1) % (mod - 1)) % mod;
        ans += tmp;
    }
    cout << ans % mod;
    return 0;
}