#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
  int n;cin>>n; 
  vc<int>v(n); rep(i,n)cin>>v[i]; rep(i,n)v[i]--;
  fenwick_tree<int>fw(n);
  mint t=0;
  rep(i,n){
    t+=fw.sum(v[i],n);
    fw.add(v[i],1);
  }
  fenwick_tree<mint>fwx(n);
  rep(i,n){
    t-=fwx.sum(v[i],n)/mint(2).pow(i);
    fwx.add(v[i],mint(2).pow(i));
  }
  t*=mint(2).pow(n-1);
  cout<<t.val();
}