#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
//#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define MINF (lint)(2e18)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define flc(x) __builtin_popcountll(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
//#define vec vector<lint>
#define nep(x) next_permutation(all(x))
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=3e5+5;
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//vector<int> bucket[MAX_N/1000];
//constexpr int MOD=1000000007;
constexpr int MOD=998244353;
//typedef __int128_t llint;
#include<atcoder/all>
using namespace atcoder;

using mint=modint998244353;
mint op(mint a,mint b){
    return a+b;
}
mint e(){
    return 0;
}

int main(void){
    lint N;
    cin >> N;
    lint P[N];
    rep(i,N) cin >> P[i],P[i]--;
    mint ans=0;
    rep(i,1<<(N-1)){
        vector<lint> p;
        vector<lint> acum;
        rep(j,N){
            acum.push_back(P[j]);
            if(j==N-1 || i&(1<<j)){
                sort(all(acum));
                for(auto e:acum) p.push_back(e);
                acum.clear();
            }
        }
        rep(j,N) for(int k=j+1;k<N;k++) if(p[j]>p[k]) ans++;
    }
    cout << ans.val() << endl;
    /*segtree<mint,op,e> seg(N);
    segtree<mint,op,e> n_inv(N);
    mint minus=0;
    mint fans=0;
    rep(i,N){
        fans+=n_inv.prod(P[i]+1,N);
        n_inv.set(P[i],1);
    }
    fans*=pow_mod(2,N-1,MOD);
    rep(i,N){
        mint sum=seg.prod(P[i]+1,N);
        sum*=pow_mod(2,N-1,MOD);
        sum*=inv_mod(pow_mod(2,i,MOD),MOD);
        minus+=sum;
        seg.set(P[i],pow_mod(2,i,MOD));
    }
    cout << (fans-minus).val() << endl;*/
}