#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 22 + 5;
const int ALL = (1<<22) + 5;
const int mod = 998244353;
const ll linf = 0x3f3f3f3f3f3f3f3f;

#define bbit(i) (1<<(i))
#define bdig(x,i) (((x)>>(i))&1)

ll a[MAXN];

int main(void)
{
	int n;
	scanf("%d",&n);
	for(int i=0; i<n; ++i)
		scanf("%lld",&a[i]);
	
	reverse(a+1, a+n);
	
	int all = (1<<n)-1;
	
	static ll f[ALL];
	memset(f, 0x3f, sizeof(f));
	f[1] = 0;
	for(int mask=1; mask<=all; ++mask)
	{
		for(int i=0; i<n; ++i)
		{
			int nxt = mask;
			nxt |= (mask << i) & all;
			nxt |= ((mask << i) >> n) & all;
			f[nxt] = min(f[nxt], f[mask] + a[i]);
		}
	}
	
	ll ans = 0;
	for(int mask=all; mask>=1; --mask)
	{
		ans = (ans + f[mask] %mod * mask) %mod;
		for(int i=0; i<n; ++i) if(bdig(mask, i))
			f[mask ^ bbit(i)] = min(f[mask ^ bbit(i)], f[mask]);
	}
	printf("%lld\n",ans);
	return 0;
}