/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
struct CountGraphs
{
	#define maxn 600005
#define mod 998244353
#define rep(i,j,k) for(int i=(j),LIM=(k);i<=LIM;i++)
#define per(i,j,k) for(int i=(j),LIM=(k);i>=LIM;i--)

int Wl,Wl2,w[maxn]={1},lg[maxn],inv[maxn]={1,1},fac[maxn]={1,1},invf[maxn]={1,1};
int Pow(int b,int k){ int r=1;for(;k;k>>=1,b=1ll*b*b%mod) if(k&1) r=1ll*r*b%mod; return r; }
void init(int n){
	for(Wl=1;n>=Wl<<1;Wl<<=1); w[1]=Pow(3,(mod-1)/(Wl2=Wl<<1));
	rep(i,2,Wl2) w[i]=1ll*w[i-1]*w[1]%mod,lg[i]=lg[i>>1]+1,fac[i]=1ll*fac[i-1]*i%mod,
		inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod,invf[i]=1ll*invf[i-1]*inv[i]%mod;
}
void NTT(int *A,int n,int tp){
	static int r[maxn];
	rep(i,1,n-1) i<(r[i]=r[i>>1]>>1|(i&1)<<lg[n]-1) && (swap(A[i],A[r[i]]),0);
	for(int L=1,B=Wl;L<n;L<<=1,B>>=1) for(int s=0;s<n;s+=L<<1) for(int k=s,x=0,t;k<s+L;k++,x+=B)
		t=1ll*w[tp^1?Wl2-x:x]*A[k+L]%mod,A[k+L]=(A[k]-t)%mod,A[k]=(A[k]+t)%mod;
	if(tp^1) rep(i,0,n-1) A[i]=1ll*A[i]*inv[n]%mod;
}
void Inv(int *A,int *B,int n){
	B[B[1]=0]=Pow(A[0],mod-2);
	static int t[maxn];
	for(int k=2,L=4;k<(n<<1);k<<=1,L<<=1){
		rep(i,0,L-1) t[i]=i<k?A[i]:B[i]=0;
		NTT(t,L,1),NTT(B,L,1);
		rep(i,0,L-1) B[i]=B[i]*(2-1ll*t[i]*B[i]%mod)%mod;
		NTT(B,L,-1);
		rep(i,min(n,k),L-1) B[i] = 0;
	}
}
void Ln(int *A,int *B,int n){
	static int t[maxn];
	int L = 1 << lg[2*n-2] + 1;
	Inv(A,B,n);
	rep(i,0,L-1) t[i] = i < n-1 ? A[i+1] * (i+1ll) % mod : B[i] = 0;
	NTT(t,L,1),NTT(B,L,1);
	rep(i,0,L-1) t[i] = 1ll * t[i] * B[i] % mod;
	NTT(t,L,-1);
	B[0] = 0;
	rep(i,1,L-1) B[i] = i < n ? 1ll * t[i-1] * inv[i] % mod : 0; 
}
void Exp(int *A,int *B,int n){
	B[B[1] = 0] = 1;
	static int t[maxn];
	for(int k=2,L=4;k<(n<<1);k<<=1,L<<=1){
		Ln(B,t,k);
		rep(i,0,L-1) t[i] = i < k ? ((i == 0) + A[i] - t[i]) % mod : B[i] = 0;
		NTT(t,L,1),NTT(B,L,1);
		rep(i,0,L-1) B[i] = 1ll * t[i] * B[i] % mod;
		NTT(B,L,-1);
		rep(i,min(n,k),L-1) B[i] = 0;
	} 
}

int F[maxn],D[maxn],B[maxn],C[maxn],E[maxn],G[maxn];
int calc(int n)
{
	for(int j=0;j<n;j++)
	C[j] = j < n ? (-1ll * D[j] * n) % mod : 0;
	Exp(C,G,n);
	int ans = 0;
	for(int i=0;i<n;i++)
	ans = (ans + 1ll * G[i] * E[n-1-i]) % mod;
	ans = (1ll * ans * fac[n-1] % mod * inv[n] % mod + mod) % mod;
	return ans;
	
}
void init(){
	init(200000);
	for(int i=0;i<=100000;i++) F[i] = 1ll * Pow(2 , (i * (i-1ll) / 2) % (mod - 1)) * invf[i] % mod;
	Ln(F,D,100001);
	for(int i=0;i<=100000;i++) D[i] = 1ll * D[i] * i % mod;
	for(int i=0;i<100000;i++) E[i] = 1ll * D[i+1] * (i+1) % mod;
	
}
}cg;
int fpow(int x,int b)
{
	if(x==0) return 0;
	if(b==0) return 1;
	int res=1;
	while(b>0)
	{
		if(b&1)	res=1LL*res*x%mod;
		x=1LL*x*x%mod;
		b>>=1;
	}
	return res;
}
int fac[300005],ifac[300005];
int C(int x,int y)
{
	if(y>x) return 0;
	if(x==y||y==0) return 1;
	return 1LL*fac[x]*ifac[x-y]%mod*ifac[y]%mod;
}
void init(int x)
{
	fac[0]=fac[1]=1;
	for(int i=2;i<=x;i++) fac[i]=1LL*fac[i-1]*i%mod;
	ifac[x]=fpow(fac[x],mod-2);  // x should be less than mod!!!
	for(int i=x-1;i>=0;i--) ifac[i]=1LL*ifac[i+1]*(i+1)%mod;
}
int F[405],a[405];
int g[405][405],h[405][405];
void solve()
{
	init(100000); 
	cg.init();
	for(int i=1;i<=400;i++) F[i]=cg.calc(i);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) g[i][1]=F[i]*i%mod;
	g[n][1]=F[n]; 
	for(int k=1;k<n;k++) for(int i=k;i<n;i++) if(g[i][k])
	{
		for(int d=1;i+d<=n;d++) g[i+d][k+1]=(g[i+d][k+1]+g[i][k]*C(i+d-k-1,i-k)%mod*d%mod*F[d])%mod;
	} 
	h[0][0]=1;
	for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) for(int lst=0;lst<i;lst++) h[i][j]=(h[i][j]+h[lst][j-1]*a[i])%mod;
	int ans=0;
	for(int k=1;k<=n;k++)
	{
		int nw=0;
		for(int i=k;i<=n;i++) nw=(nw+h[i][k])%mod; 
//		cout<<nw<<" ";
		nw=nw*g[n][k]%mod;
		if(k>=3) nw=nw*fpow(n,k-2)%mod; 
//		cout<<" "<<g[n][k]<<"\n";
		ans=(ans+nw)%mod;
	}
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}