#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
#define int ll
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

const int mod = 998244353;

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> w(n);
    for (int i = 0; i < n; ++i) cin >> w[i];
    vector<int> lol((1 << n), 1e18);
    lol[0] = 0;
    lol[1] = 0;
    set<pair<int, int>> cur;
    for (int i = 0; i < (1 << n); ++i) cur.insert({lol[i], i});
    while (cur.size()) {
        pair<int, int> lolll = *cur.begin();
        int mask = lolll.second;
        cur.erase(cur.begin());
        for (int i = 1; i < n; ++i) {
            int tmask = ((mask | ((mask << i) | (mask << i >> n))) & ((1 << n) - 1));
//            cout << mask << ' ' << i << ' ' << tmask << '\n';
            if (lol[tmask] > lol[mask] + w[i]) {
                cur.erase({lol[tmask], tmask});
                lol[tmask] = lol[mask] + w[i];
                cur.insert({lol[tmask], tmask});
            }
        }
    }
    for (int i = (1 << n) - 1; i >= 0; --i) {
        for (int j = 0; j < n; ++j) lol[i] = min(lol[i], lol[(i | (1 << j))]);
    }
    int ans = 0;
    for (int i = 1; i < (1 << n); ++i) {
//        cout << lol[i] << ' ';
        int x = 0;
        for (int j = 1; j < n; ++j) {
            if ((i >> j) & 1) {
                x += (1 << (n - j));
            }
        }
        ans += i * lol[x];
        ans %= mod;
    }
    cout << ans;
}