#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
using i64 = long long;
mt19937_64 rd(time(0));
template <class K, class C = less<>> using paring_heap = __gnu_pbds::priority_queue<K, C>;
template <class K> using rb_tree = tree<K, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class ... A> void debug(const T & t, const A & ... a) { cerr << "[" << t, ((cerr << ", " << a), ...), cerr << "]\n"; }
const i64 mod = [](bool n) { return n ? 998244353 : 1e9 + 7; } (1);

void QAQ() {
    int n;
    cin >> n;

    vector<int> a(n);
    vector<int> dp(1ll << n, 4e18);
    dp[0] = dp[1] = 0;

    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (i) {
            auto dpn = dp;
            int t = n - i;
            for (int sta = 0; sta < (1ll << n); sta++) {
                int lst = sta;
                for (int j = 1; j < n; j++) {
                    int m1 = lst & ((1ll << n - t) - 1), m2 = lst ^ m1;
                    int msk = lst | (m1 << t) | (m2 >> n - t) | (1ll << t);
                    dpn[msk] = min(dp[sta] + a[i] * j, dpn[msk]);
                    lst = msk;
                }
            }
            swap(dpn, dp);
        }
    }

    int ans = 0;

    for (int sta = (1ll << n) - 1; ~sta; sta--) {
        for (int i = 0; i < n; i++) {
            if ((sta >> i & 1) == 0) {
                dp[sta] = min(dp[sta], dp[sta ^ (1ll << i)]);
            }
        }
        (ans += sta * dp[sta]) %= mod;
    }

    cout << ans << "\n";
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    for (cout << fixed << setprecision(12); t--; QAQ());
}