#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

struct S {
  mint sm = 0;
  mint coeff = 1;
};

S op1(S x, S y) {
  return {x.sm + y.sm * x.coeff, x.coeff * y.coeff};
}
S op2(S x, S y) {
  return {x.sm * y.coeff + y.sm, x.coeff * y.coeff};
}

S e() { return S{}; }

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  VI ord(n);
  iota(all(ord), 0);
  sort(all(ord), [&](int i, int j) { return a[i] < a[j]; });
  segtree<S, op1, e> seg1(vector<S>(n, {1, 1}));
  segtree<S, op2, e> seg2(vector<S>(n, {1, 1}));
  mint ans;
  for(int i: ord) {
    ans += a[i] * (1 + seg1.prod(i + 1, n).sm) * (1 + seg2.prod(0, i).sm);
    seg1.set(i, {2, 2});
    seg2.set(i, {2, 2});
  }
  cout << ans.val() << endl;
}