#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef APURBA
#include "DEBUG_TEMPLATE.h"
#else
#define HERE
#define debug(args...)
#endif
#define ALL(x) x.begin(),x.end()

const int N = 22;
typedef pair<int,int> pii;

int n;
ll w[N];
ll ans[1<<N];
bool pro[1<<N];

void TEST_CASES()
{
    cin>>n;
    int cnt=0;
    for(int i=1; i<n; i++)
    {

        int mask=1;
        for(int j=1; j<=n; j++)
        {
            int w=i*j%n;
            if(mask&(1<<w)) continue;
            mask|=(1<<w);
            cnt++;
        }
    }
    debug(cnt);

    for(int i=0; i<n; i++)
        cin>>w[i];

    for(int i=1; i<(1<<n); i++)
        ans[i]=1e18,pro[i]=false;
    ans[1]=0;

    priority_queue<pair<ll,int>>q;
    q.push({0,1});
    while(!q.empty())
    {
        int u=q.top().second;
        q.pop();
        if(pro[u]) continue;
        pro[u]=true;
        for(int i=1; i<n; i++)
        {
            ll mask=u;
            mask=mask|(mask<<i);
            ll up=((1LL<<(n*2))-1)-((1LL<<(n))-1);
            ll down=((1LL<<(n))-1);
            up=mask&up;
            up>>=n;
            down=mask&down;
            down|=up;
            if(ans[down]>ans[u]+w[i])
            {
                ans[down]=ans[u]+w[i];
                q.push({-ans[down],down});
            }
        }
    }
//    for(int i=1;i<(1<<n);i++)
//        debug(i,ans[i]);
    vector<ll>need(1<<n),nxt(1<<n);
    for(int i=1;i<(1<<n);i++)
        need[i]=ans[i];

    for(int i=n-1;i>=0;i--)
    {
        for(int mask=1;mask<(1<<n);mask++)
        {
            if(mask&(1<<i))
            {
                nxt[mask]=need[mask];
            }
            else
            {
                nxt[mask]=min(need[mask],need[mask^(1<<i)]);
            }
        }
        swap(need,nxt);
    }
    debug(need);
    ll ans=0;
    const int M=998244353;
    for(int mask=1;mask<(1<<n);mask++)
    {
        int w=0;
        for(int i=0;i<n;i++)
        {
            if(mask&(1<<i))
            {
                int g=n-i;
                g%=n;
                w|=(1<<g);
            }
        }
        need[w]%=M;
        ans+=(1LL*need[w]*mask);
        ans%=M;
    }

    cout<<ans;
}




/*
*/

int32_t main()
{
#ifndef APURBA
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    //freopen("input.txt","r",stdin);
    //freopen("out1.txt","w",stdout);
    int t=1;
    //cin>>t;
    while(t--)
    {
        TEST_CASES();
    }
    return 0;
}