#include <bits/stdc++.h>
#include <atcoder/modint>
using mint = atcoder::modint998244353;
using ll = long long;
using namespace std;

template <class T>
struct BIT {
    BIT(int n) : b(n + 1), n(n) {}
    void add(int i, T v) {
        for (int k = i + 1; k <= n; k += k & -k) b[k] += v;
    }
    T sum(int k) {
        T s = 0;
        for (; k > 0; k -= k & -k) s += b[k];
        return s;
    }
    vector<T> b;
    int n;
};

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

    int n;
    cin >> n;

    vector<int> p(n);
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        p[i]--;
    }

    mint x = 0, t = 1, s = 1, h = mint(2).inv(), u = 0;

    BIT<mint> b0(n), b1(n);
    for (int i = 0; i < n; i++) {
        if (i > 0) x += i - b0.sum(p[i]) - (u - b1.sum(p[i])) * s;
        b0.add(p[i], 1);
        b1.add(p[i], t);
        u += t;
        t *= 2;
        s *= h;
    }
    x *= mint(2).pow(n - 1);

    cout << x.val() << endl;

    return 0;
}