#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")


#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvpii vector<vector<pair<int,int>>>
#define vvpll vector<vector<pair<ll,ll>>>

template<typename T> void debug(T e){
    cerr << e << endl;
}

template<typename T> void debug(vector<T> &v){
    rep(i, v.size()){
        cerr << v[i] << " ";
    }
    cerr << endl;
}

template<typename T> void debug(vector<vector<T>> &v){
    rep(i, v.size()){
        rep(j, v[i].size()){
            cerr << v[i][j] << " ";
        }
        cerr << endl;
    }
}

template<typename T> void debug(vector<pair<T, T>> &v){
    rep(i,v.size()){
        cerr << v[i].first << " " << v[i].second << endl;
    }
}

template<typename T> void debug(set<T> &st){
    for (auto itr = st.begin(); itr != st.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(multiset<T> &ms){
    for (auto itr = ms.begin(); itr != ms.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(map<T, T> &mp){
    for (auto itr = mp.begin(); itr != mp.end(); itr++){
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out(){
    cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
    cerr << H << " ";
    debug_out(T...);
}

ll op(ll a, ll b){
    return (a + b) % mod2;
}

ll e(){
    return 0LL;
}

ll mapping(ll f, ll x){
    return (f * x) % mod2;
}

ll composition(ll f, ll g){
    return (f * (g)) % mod2;
}

ll id(){
    return 1LL;
}

int main(){
    ll N;
    cin >> N;
    vl P(N);
    rep(i,N){
        cin >> P[i];
        P[i]--;
    }
    ll p2 = 1;
    vl pow_2(N + 1);
    pow_2[0] = 1;
    for (ll i = 0; i < N; i++){
        pow_2[i + 1] = (pow_2[i] * 2LL) % mod2;
    }
    lazy_segtree<ll, op, e, ll, mapping, composition, id> l_seg(N);
    segtree<ll, op, e> seg(N);
    ll ans = 0;
    for (ll i = 0; i < N; i++){
        seg.set(P[i], p2);

        ll val_sum = seg.prod(P[i] + 1, N);
        ans = (ans + mod2 - (val_sum * pow_2[N - 1 - i]) % mod2) % mod2;

        l_seg.set(P[i], p2);
        ll prd = l_seg.prod(P[i] + 1, N);
        ans = (ans + (prd * pow_2[N - 1 - i]) % mod2) % mod2;
        l_seg.apply(0, N, 2LL);
        /*for (ll j = 0; j < N; j++){
            cout << l_seg.get(j) << " ";
        }
        cout << endl;*/
        //debug(ans);
        p2 = (p2 * 2) % mod2;
    }
    cout << ans << endl;
}