#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
#include <atcoder/fenwicktree>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;


int main(){
    int N; cin >> N;
    vector<int> P(N); rep(i,N){ cin >> P[i]; P[i]--; }
    Modint inv2 = Modint(2).inv();
    atcoder::fenwick_tree<Modint> bit(N);
    atcoder::fenwick_tree<Modint> bitc(N);
    Modint ans = 0;
    rep(i,N){
        bit.add(P[i], Modint::raw(2).pow(i));
        bitc.add(P[i], 1);
        ans += bitc.sum(P[i]+1, N);
        ans -= bit.sum(P[i]+1, N) * inv2.pow(i);
    }
    ans *= Modint(2).pow(N-1);
    cout << ans.val() << endl;
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;