#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);++i)
using namespace std;
typedef long long ll;
const int N=(1<<20)+10,P=998244353;
int n,a[30];
ll f[N],ans;
int move(int s,int i){
    return ((s<<i)&((1<<n)-1))|(s>>n-i);
}
int main(){
    scanf("%d",&n);
    rep(i,0,n-1) scanf("%d",a+i);reverse(a+1,a+n);
    rep(i,2,(1<<n)-1) f[i]=1e18;
    rep(i,1,(1<<n)-1) for(int j=0;j<n;++j){
        int k=i|move(i,j);
        f[k]=min(f[k],f[i]+a[j]);
    }
    rep(i,0,n-1) rep(j,0,(1<<n)-1) 
        if(j&(1<<i)) f[j^(1<<i)]=min(f[j],f[j^(1<<i)]);
    rep(i,0,(1<<n)-1)
        ans=(ans+(f[i]%P)*i)%P;
    printf("%lld\n",ans);
    return 0;
}