#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/segtree>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using P = pair<int, int>;
using mint = atcoder::modint998244353;

struct node{
    mint sum, prod;
};

node e() {
    return node{mint(0), mint(1)};
}

node opl(node n1, node n2){ // 左から
    return node{n1.sum+n2.sum*n1.prod, n1.prod*n2.prod};
}

node opr(node n1, node n2){ // 右から
    return node{n2.sum+n1.sum*n2.prod, n1.prod*n2.prod};
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> a(n);
    vector<P> p(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        p[i] = P(a[i], i);
    }
    sort(p.begin(), p.end());
    atcoder::segtree<node, opl, e> sgtl(vector<node>(n, node{mint(1), mint(1)}));
    atcoder::segtree<node, opr, e> sgtr(vector<node>(n, node{mint(1), mint(1)}));
    mint ans = 0;
    for(auto [x, i]: p){
        auto qr = sgtr.prod(0, i);
        auto ql = sgtl.prod(i+1, n);
        // cout << qr.sum.val() << ' ' << qr.prod.val() << ' ' << ql.sum.val() << ' ' << ql.prod.val() << endl;
        ans += (ql.sum+1)*(qr.sum+1)*x;
        sgtl.set(i, node{mint(2), mint(2)});
        sgtr.set(i, node{mint(2), mint(2)});
    }
    cout << ans.val() << endl;
}