// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
const int MOD = 998244353;
struct mint
{
    unsigned v;
    mint(unsigned v = 0) : v(v) {}
    mint operator-() const { return v ? MOD - v : v; }
    mint &operator+=(const mint &X) { return (v += X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator-=(const mint &X) { return (v += MOD - X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator*=(const mint &X) { return v = 1llu * v * X.v % MOD, *this; }
    mint &operator/=(const mint &X) { return *this *= X.inv(); }
    mint pow(long long B) const
    {
        B %= MOD - 1;
        if (B < 0)
            B += MOD - 1;
        mint res = 1, A = *this;
        while (B)
        {
            if (B & 1)
                res *= A;
            B >>= 1;
            A *= A;
        }
        return res;
    }
    mint inv() const { return pow(MOD - 2); }
    friend mint operator+(const mint &A, const mint &B) { return mint(A) += B; }
    friend mint operator-(const mint &A, const mint &B) { return mint(A) -= B; }
    friend mint operator*(const mint &A, const mint &B) { return mint(A) *= B; }
    friend mint operator/(const mint &A, const mint &B) { return mint(A) /= B; }
    friend std::istream &operator>>(std::istream &A, mint &B) { return A >> B.v; }
    friend std::ostream &operator<<(std::ostream &A, const mint &B) { return A << B.v; }
    explicit operator bool() const { return v; }
    friend bool operator==(const mint &A, const mint &B) { return A.v == B.v; }
} a[405], inv[405], f[405], fact[405], ifact[405], ans, g[405];
using poly = std::vector<mint>;
int n;
// F'G=G'
poly Ln(poly G)
{
    poly F;
    F.push_back(0);
    for (std::size_t i = 1; i != G.size(); ++i)
    {
        mint tmp = i * G[i];
        for (std::size_t j = 1; j != i; ++j)
            tmp -= (i - j) * F[i - j] * G[j];
        F.push_back(tmp / i);
    }
    return F;
}
poly Exp(poly F)
{
    poly G;
    G.push_back(1);
    for (std::size_t i = 1; i != F.size(); ++i)
    {
        mint tmp = 0;
        for (std::size_t j = 0; j != i; ++j)
            tmp += (i - j) * F[i - j] * G[j];
        G.push_back(tmp / i);
    }
    return G;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n;
    fact[0] = 1;
    for (int i = 1; i <= n; ++i)
        fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i; --i)
        ifact[i - 1] = ifact[i] * i;
    inv[1] = 1;
    for (int i = 2; i <= n; ++i)
        inv[i] = -inv[MOD % i] * (MOD / i);
    for (int i = 1; i <= n; ++i)
        std::cin >> a[i];
    poly F(n + 1);
    for (int i = 0; i <= n; ++i)
        F[i] = mint(2).pow(i * (i - 1) / 2) * ifact[i];
    F = Ln(F);
    for (int i = 1; i <= n; ++i)
        F[i] = -F[i] * i;
    F = Exp(F);
    poly G(n + 1);
    G[0] = 1;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = n; j >= 0; --j)
        {
            mint tmp = 0;
            for (int k = 0; k <= j; ++k)
                tmp += G[k] * F[j - k];
            G[j] = tmp;
        }
        f[i] = -G[i];
    }
    g[0] = 1;
    for (int i = 1; i <= n; ++i)
        for (int j = n; j; --j)
            g[j] = g[j - 1] * a[i] + g[j];
    F.assign(f, f + n + 1);
    G.assign(n + 1, 0);
    G[0] = 1;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = n; j >= 0; --j)
        {
            mint tmp = 0;
            for (int k = 0; k <= j; ++k)
                tmp += G[k] * F[j - k];
            G[j] = tmp;
        }
        ans += g[i] * G[n] * mint(n).pow(i - 2) * fact[n - i];
    }
    std::cout << ans << std::endl;
    return 0;
}