#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using S = mint;
using F = mint;
S op(S a, S b) { return a + b; }
S e() { return 0; }
S mapping(F f, S x) { return f * x; }
F composition(F f, F g) { return f * g; }
F id() { return 1; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<P>a(n);
	rep(i, n)cin >> a[i].first, a[i].second = i;
	sort(all(a));
	vector<mint>v(n, 1);
	lazy_segtree<S, op, e, F, mapping, composition, id> segl(v);
	lazy_segtree<S, op, e, F, mapping, composition, id> segr(v);
	mint ans = 0;
	rep(i, n) {
		int pos = a[i].second;
		mint ml = segl.prod(0, pos) / segl.get(pos) + 1;
		mint mr = segr.prod(pos + 1, n) / segr.get(pos) + 1;
		ans += ((mint)a[i].first) * ml * mr;
		segr.apply(pos, n, 2);
		segl.apply(0, pos + 1, 2);
	}
	cout << ans.val() << endl;
	return 0;
}