#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
const int mod=998244353;
#define inf 1e9
#define ll long long
inline int read(){
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+c-'0';c=getchar();}
	return x*f;
}
const int N=22;
int n,m,w[N];
ll dp[1<<N],ans;
#define INF 1e18
int main(){
	n=read();
	for(int i=0;i<n;i++)w[i]=read();
	for(int i=0;i<(1<<n);i++)dp[i]=INF;
	dp[1]=dp[0]=0;int all=(1<<n)-1;
	for(int i=1;i<n;i++)
		for(int j=1;j<(1<<n);j++){
			ll S=j|(j<<i);
			S=(S&all)|(S>>n);
			dp[S]=min(dp[S],dp[j]+w[i]);
		}
	for(int i=all;i;--i)
		for(int j=0;j<n;j++)if(i>>j&1)
			dp[i^(1<<j)]=min(dp[i^(1<<j)],dp[i]);
	for(int i=1;i<=all;i++){
		int S=0;
		for(int j=1;j<n;j++)
			if(i>>j&1)S|=(1<<(n-j));
		ans=(ans+dp[S]%mod*i)%mod;
	}printf("%lld\n",ans);
	return 0;
}