#include<bits/stdc++.h>
using namespace std;
const int N=24;
int n,a[N];
#define ll long long
ll f[1<<22];
const ll inf=1e12;
const int mod=998244353;
int main()
{
    scanf("%d",&n);
    for (int i=0;i<n;++i)
        scanf("%d",&a[i]);
    for (int i=2;i<(1<<n);++i)
        f[i]=inf;
    int musk=(1<<n)-1;
    for (int i=1;i<(1<<n);++i)
        for (int j=1;j<n;++j)
        {
            int to=(i|(i<<j)|((i<<j)>>n))&musk;
            f[to]=min(f[to],f[i]+a[j]);
        }
//    for (int i=1;i<(1<<n);++i)
//        cout<<f[i]<<' ';
//    cout<<endl;
    for (int i=0;i<n;++i)
        for (int j=0;j<(1<<n);j+=(1<<i)<<1)
            for (int k=0;k<(1<<i);++k)
            {
                f[j+k]=min(f[j+k],f[j+k+(1<<i)]);
            }
    ll ans=0;
    for (int i=1;i<(1<<n);++i)
    {
        ll sum=0;
        for (int j=1;j<n;++j)
            if (i&(1<<j))
                sum+=(1<<(n-j));
        if (i%2==1)
            ++sum;
//        cout<<i<<' '<<f[i]<<' '<<sum<<endl;
        (ans+=f[i]%mod*sum%mod)%=mod;
    }
    cout<<ans<<endl;
    return 0;
}