#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nn=5e6+10;
ll n;
ll dp[nn];
ll w[30];
ll val[30];
ll AN[nn];
ll val2[30];
const ll mod=998244353;
void dfs(ll x, ll cost)
{
	if(val[x]<=cost)
	{
		return ;
	}
	val[x] = cost;
	for(int i=0;i<=n-1;++i)
	{
		dfs((x+i)%n, (cost+w[i]));	
	}
}
void solve(){
	cin>>n;
	for(int i=0;i<=n-1;i++){
		cin>>w[i];
	}
	memset(val,0x3f,sizeof val);
	dfs(0, 0);
	for(int i=1;i<=n-1;i++){
		val2[n-i]=val[i];
	}
	for(int i=1;i<=n-1;i++){
		val[i]=val2[i];
	}
	
	for(int i=0;i<=n;i++)val[i]%=mod;
	memset(dp,0x3f,sizeof dp);
	dp[0]=0;
	for(int i=0;i<(1<<n);i++){
		for(int j=0;j<n;j++){
			if((i>>j)&1){
				ll ne=i^(1<<j);
				dp[i]=min(dp[i],dp[ne]+val[j]);
				for(int k=0;k<n;k++){
					if(k==j)continue;
					if((i>>k)&1){
						dp[i]=min(dp[i],dp[ne]+val[(j-k+n)%n]);
					}
				}
			}
		}
	}
	
	ll dd=0;
	for(int i=1;i<(1<<n);i++){
		ll bas=1;
		ll an=0;
		for(int j=0;j<n;j++){
			if((i>>j)&1){
				an+=bas;
				an%=mod;
			}
			bas*=2;
			bas%=mod;
		}
		dd+=dp[i]*an%mod;
		dd%=mod;
	}
	cout<<dd<<"\n";
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	solve();
}
/*
1
514 2 10
0 1 2 3 %4 
4
1919810 999999998 999999997 114114514

*/