#include <bits/stdc++.h>
#include <bits/extc++.h> 
using namespace std;
#define sz(x) (int)(x).size()
#define rep(i, l, r) for (int i = l; i < (r); i++)
#define rrep(i, l, r) for(int i = (int)(r)-1; i >= (int)(l); i--)
#define all(x) begin(x), end(x)

using ll = long long;
using vi = vector<int>;

using pii = pair<int, int>;

const ll inf = 1e18;
const ll mod = 998244353;

int main() {
    std::cin.tie(0)->sync_with_stdio(0);

    int n;cin >> n;
    vector<ll> w(n);rep(i, 0, n) cin >> w[i];
    vector<ll> dp(1<<n, inf);
    dp[1] = 0;
    ll z = (1 << n) - 1;
    for(ll i = 0; i < 1<<n ; i++) {
        rep(j, 0, n) {
            ll x = (i | (i << j) | ((i << j) >> n)) & z;
            cout << i << " " << j << " " << x << endl;
            dp[x] = min(dp[x], dp[i] + w[j]);
        }
    }

    for(int i = (1<<n) - 1; i >= 1; i--) {
        rep(j, 0, n) {
            if (i >> j & 1) continue;
            dp[i] = min(dp[i], dp[i | (1 << j)]);
        }
    }

    ll ans = 0;
    rep(i, 1, 1<<n) {
        ll x = 0;
        rep(j, 0, n) {
            if (i >> j & 1) {
                if (j == 0) x += 1;
                else x += (1 << (n - j));
            }
        }
        ans += dp[i] * x % mod;
        ans %= mod;
        // cout << i << " " << dp[i] << endl;
    }
    cout << ans << endl;
}