#include <iostream>
#include <atcoder/modint>
#include <queue>

using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
const int MX = 1000010;
mint f[MX],inv[MX],fi[MX];
constexpr ll mod = 998244353;
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i];
    }
    f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i;
        fi[i] = fi[i-1]*inv[i];
    }
}

mint nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]*fi[n-k];
}

mint pw(mint a,ll x){
    mint ret = 1;
    while(x){
        if(x&1) (ret *= a);
        (a *= a); x /= 2;
    }
    return ret;
}

#include <atcoder/convolution>

mint a[200010];
int main(){
    solve();
    int i,n; cin >> n;
    for(i=0;i<n;i++){
        ll x; cin >> x; a[i] = (mint)x;
    }
    queue<vector<mint>> que;
    for(i=0;i<n;i++) que.push({1,a[i]});
    while(que.size()>1){
        auto f1 = que.front(); que.pop();
        auto f2 = que.front(); que.pop();
        que.push(convolution(f1,f2));
    }
    auto g = que.front();
    mint ans = 0;
    for(i=1;i<g.size();i++){
        // cout << g[i].val() << "\n";
        ans += g[i]*pw(i,n - i);
    }
    cout << ans.val() << "\n";
}