#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cmath>
#include<stack>
#include<vector>
#include<map>
#define ll long long
#define lowbit(x) x&(-x)
using namespace std;
int n;
ll w[50005],d[25][25],f[5000005],ans,mod=998244353;
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;++i){
		scanf("%lld",&w[i]);
		for(int j=0;j<n;++j){
			d[j][(j+i)%n]=w[i];
		}
	}
	for(int i=0;i<n;++i) d[i][i]=0;
	for(int k=0;k<n;++k)
		for(int i=0;i<n;++i)
			for(int j=0;j<n;++j)
				d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
	for(int i=1;i<(1<<n);++i) f[i]=1e16;
	for(ll i=0;i<(1<<(n-1));++i){
		for(int j=1;j<n;++j){
			if((1<<(j-1))&i){
				f[i]=min(f[i],f[i^(1<<(j-1))]+d[j][0]);
				for(int k=1;k<n;++k){
					if(((1<<(k-1))&i)&&j!=k){
						f[i]=min(f[i],f[i^(1<<(j-1))]+d[j][k]);
					}
				}
			}
		}
		ans=(ans+(f[i]%mod)*((i*2+i*2+1)%mod)%mod)%mod;
	}
	printf("%lld",ans);
}