#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)
using i64 = long long;
using pii = pair<int, int>;
using piii = pair<pii, int>;
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int P = 998244353;
void add(int &x, int y) { (x += y) >= P && (x -= P); }
int Add(int x, int y) { return (x += y) >= P ? (x - P) : x; }
void sub(int &x, int y) { (x -= y) < 0 && (x += P); }
int Sub(int x, int y) { return (x -= y) < 0 ? (x + P) : x; }
void mul(int &x, int y) { x = 1ll * x * y % P; }
int Mul(int x, int y) { return 1ll * x * y % P; }
int power(int a, int b, int c = 1) {
    for (; b; b >>= 1, mul(a, a))
        if (b & 1) mul(c, a);
    return c;
}

const int N = 22, S = 1 << N | 5;
int n, w[N+1];
i64 dp[S];

// void solve() {

// }

void dfs(int cur, int msk, i64 sum) {
    down(dp[msk], sum);
    rep(i, cur, n - 1) {
        int msk1 = msk;
        rep(j, 0, n - 1) {
            if (msk >> j & 1) {
                msk1 |= 1 << ((i + j) % n);
            }
        }
        if (msk1 == msk) continue;
        dfs(i, msk1, sum + w[i]);
    }
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    // int t; cin >> t;
    // while (t--) solve();

    cin >> n;
    per(i, n, 1) cin >> w[i];
    
    memset(dp, 0x3f, sizeof dp);
    dfs(0, 1, 0);
    rep(i, 0, n - 1) {
        rep(s, 0, (1 << n) - 1) {
            if (s >> i & 1) {
                down(dp[s ^ 1 << i], dp[s]);
            }
        }
    }

    int ans = 0;
    rep(s, 0, (1 << n) - 1) add(ans, Mul(dp[s] % P, s));
    cout << ans << "\n";

    return 0;
}