#include<bits/stdc++.h>
#define ll   long long
#define pb   emplace_back
#define mp   make_pair
#define orz  1000000007
#define fi   first
#define se   second
#pragma GCC optimize("O2")
typedef unsigned int uint;
typedef long long int int64;
typedef long long unsigned int uint64;



constexpr uint Max_N = 4200005;

int64 Dist[Max_N];

struct A_Wonderful_Heap
{
	int size;
	int cur[Max_N];
	int val[Max_N * 2];
	
	void _set(const int i, const int x)
	{
		val[i] = x, cur[x] = i;
	}
	
	int _min(const int x, const int y)
	{
		return Dist[x] < Dist[y] ? x : y;
	}
	
	void _update(int i, int flag = 0)
	{
		const int x = val[i];
		const int64 d = Dist[x];
		while ((i >>= 1) && Dist[val[i]] >= d)
			val[i] = x;
	}
	
	void insert(int x)
	{
		_set(size * 2 + 1, x);
		if (size)
			_set(size * 2, val[size]), _update(size * 2 + 1, 1);
		++size;
	}
	
	void decrease(int x)
	{
		_update(cur[x]);
	}
	
	void erase()
	{
		int i = cur[val[1]];
		if (--size)
		{
			if ((i >> 1) == size)
				_set(size, val[i ^ 1]), i = size;
			else
				_set(i, val[size] != val[size * 2] ? val[size * 2] : val[size * 2 + 1]), cur[val[size]] = size;
			for (int x; i != 1; val[i >>= 1] = x)
				x = _min(val[i], val[i ^ 1]);
		}
	}
	
	int top()
	{
		return val[1];
	}
};
A_Wonderful_Heap pq;

int n;
int64 w[25];
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;++i)scanf("%lld",w+i);
	pq.insert(1);
	while(pq.size){
		int _=pq.top();
		int64 d=Dist[_];
		pq.erase();
		for(int i=0;i<n;++i)if(_&(1<<i)){
			int __=_^(1<<i);
			if(pq.cur[__]==0){
				Dist[__]=d;
				pq.insert(__);
			}
			else if(Dist[__]>d){
				Dist[__]=d;
				pq.decrease(__);
			}
		}
		int ___=_;
		for(int i=1;i<n;++i){
			if(___&1)___|=(1<<n);
			___>>=1;
			int __=___|_;
			if(pq.cur[__]==0){
				Dist[__]=d+w[i];
				pq.insert(__);
			}
			else if(Dist[__]>d+w[i]){
				Dist[__]=d+w[i];
				pq.decrease(__);
			}
		}
	}
	int64 ans=0;
	for(int _=1;_<(1<<n);++_)ans+=Dist[_]*_;
	printf("%lld\n",ans%998244353);
	return 0;
}