#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

#define len(a) int((a).size())
#define all(a) begin(a), end(a)
#define rep(i, n) for (int i = 0; i < (n); i++)

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n;
    cin >> n;
    const int N = (1 << n);
    vector<int> cost(n);
    for (auto& x : cost) {
        cin >> x;
    }

    vector<pair<int, int>> ord(N);
    for (int i = 0; i < N; i++) {
        ord[i] = { __builtin_popcount(i), i };
    }
    sort(all(ord));

    constexpr ll INF = 1e18;
    vector<ll> dp(N, INF);
    dp[0] = 0;
    dp[1 << 0] = 0;

    for (auto [_, mask] : ord) {
        for (int x = 1; x < n; x++) {
            int shift = (mask << x);
            int rem = (shift >> n);
            int nmask = (mask | rem | (shift & (N - 1)));
            dp[nmask] = min(dp[nmask], dp[mask] + cost[x]);
        }
    }

    for (int mask = N - 1; mask >= 0; mask--) {
        for (int i = 0; i < n; i++) {
            dp[mask] = min(dp[mask], dp[mask | (1 << i)]);
        }
    }

    constexpr int MOD = 998244353;
    ll ans = 0;
    for (int mask = 1; mask < N; mask++) {
        int need = 0, sum = 0;
        for (int i = 0; i < n; i++) {
            if (mask >> i & 1) {
                if (i == 0) {
                    need ^= 1;
                } else {
                    need ^= (1 << (n - i));
                }
                sum += (1 << i);
            }
        }
        ans += 1ll * sum * dp[need] % MOD;
        if (ans >= MOD) {
            ans -= MOD;
        }
    }
    cout << ans % MOD << '\n';
}