#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 405;

namespace ModCalculator {
    const int MOD = 998244353;
    inline void Inc(int &x, int y) {
        x += y; if (x >= MOD) x -= MOD;
    }
    inline int Add(int x, int y) {
        Inc(x, y); return x;
    }
    inline void Dec(int &x, int y) {
        x -= y; if (x < 0) x += MOD;
    }
    inline int Sub(int x, int y) {
        Dec(x, y); return x;
    }
    inline int Mul(int x, int y) {
        return 1LL * x * y % MOD;
    }
    inline int Ksm(int x, int y) {
        int ret = 1;
        for (; y; y >>= 1) {
            if (y & 1) ret = Mul(ret, x);
            x = Mul(x, x);
        }
        return ret;
    }
}
using namespace ModCalculator;

int n, a[N];
int C[N][N], g[N], c[N], f[N], tmp[N][N], dp[N][N], h[N][N];

void solve() {
    scanf("%d", &n);
    //n = 400;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        //a[i] = 1;
    }
    for (int i = 0; i <= n; ++i) {
        C[i][0] = 1;
        for (int j = 1; j <= i; ++j) {
            C[i][j] = Add(C[i - 1][j], C[i - 1][j - 1]);
        }
    }
    g[0] = g[1] = 1;
    for (int i = 2; i <= n; ++i) {
        g[i] = Mul(g[i - 1], 2);
    }
    for (int i = 2; i <= n; ++i) {
        g[i] = Mul(g[i], g[i - 1]);
    }
    for (int i = 1; i <= n; ++i) {
        c[i] = g[i];
        for (int j = 1; j < i; ++j) {
            Dec(c[i], Mul(c[j], Mul(C[i - 1][j - 1], g[i - j])));
        }
    }
    tmp[0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = i; j <= n; ++j) {
            for (int k = 1; k <= j; ++k) {
                Inc(tmp[i][j], Mul(tmp[i - 1][j - k], Mul(c[k], Mul(C[j - 1][k - 1], k))));
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        f[i] = c[i];
        for (int j = 1; j < i; ++j) {
            int cur = 0;
            for (int k = 1, pw = j; k <= i - j; ++k, pw = Mul(pw, j)) {
                Inc(cur, Mul(pw, tmp[k][i - j]));
            }
            Dec(f[i], Mul(Mul(f[j], C[i - 1][j - 1]), cur));
        }
    }
    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        dp[i][0] = 1;
        for (int j = 1; j <= i; ++j) {
            dp[i][j] = Add(dp[i - 1][j], Mul(dp[i - 1][j - 1], a[i]));
        }
    }
    h[0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; i + j <= n; ++j) {
            for (int k = 0; k <= j; ++k) {
                Inc(h[i][j], Mul(h[i - 1][j - k], Mul(C[j][k], Mul(f[k + 1], k + 1))));
            }
        }
    }
    int ans = Mul(dp[n][1], f[n]);
    for (int i = 2, pw = 1; i <= n; ++i, pw = Mul(pw, n)) {
        Inc(ans, Mul(dp[n][i], Mul(h[i][n - i], pw)));
    }
    printf("%d\n", ans);
}

int main() {
    solve();
    return 0;
}