#include <algorithm>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <functional>
#include <iostream>
#include <utility>
#include <vector>

using namespace std;

using mint = atcoder::modint998244353;

mint op(mint a, mint b) {
    return a + b;
}

mint e() {
    return mint(0);
}

mint mapping(mint f, mint x) {
    return f * x;
}

mint composition(mint f, mint g) {
    return f * g;
}

mint id() {
    return mint(1);
}

vector<size_t> sorted_idx(const vector<size_t> &A) {
    auto n = A.size();
    vector<pair<size_t, size_t>> tmp(n);
    for (size_t i = 0; i < n; i++) tmp[i] = {A[i], i};
    sort(begin(tmp), end(tmp));
    vector<size_t> ret(n);
    for (size_t i = 0; i < n; i++) ret[i] = tmp[i].second;
    return ret;
}

vector<mint> cumulative_sum(const vector<size_t> &A) {
    auto n = A.size();
    atcoder::lazy_segtree<mint, op, e, mint, mapping, composition, id> lst(vector<mint>(n, 1));
    vector<mint> ret(n);
    auto &&tmp = sorted_idx(A);
    for(auto &i : tmp) {
        ret[i] = lst.prod(0, i + 1) / lst.get(i);
        lst.apply(0, i+1, mint(2));
    }
    return ret;
}


int main() {
    size_t n;
    cin >> n;
    vector<size_t> A(n);
    for(size_t i = 0; i < n; i++) cin >> A[i];
    auto &&x = cumulative_sum(A);
    reverse(begin(A), end(A));
    auto &&y = cumulative_sum(A);
    reverse(begin(x), end(x));
    mint ans;
    for(size_t i = 0; i < n; i++) {
        ans += x[i] * y[i] * A[i];
    }
    cout << ans.val() << endl;
}