#include <bits/stdc++.h>
#define	int long long
using namespace std;
const int mod = 998244353;
struct node {
	int l, r, sum, tag = 1;
};
inline int ksm(int p, int q = mod - 2) {
	int base = 1;
	while (q) {
		if (q & 1)base = base * p % mod;
		q >>= 1;
		p = p * p % mod;
	}
	return base;
}
const int inv = ksm(2);
struct XDT {
	node b[2000006];
	inline void update(int p) {
		b[p].sum = b[2 * p].sum + b[2 * p + 1].sum;
		b[p].sum %= mod;
	}
	inline void push_down(int p) {
		if (b[p].tag != 1) {
			b[2 * p].tag *= b[p].tag;
			b[2 * p + 1].tag *= b[p].tag;
			b[2 * p].sum *= b[p].tag;
			b[2 * p + 1].sum *= b[p].tag;
			b[2 * p].tag %= mod;
			b[2 * p + 1].tag %= mod;
			b[2 * p].sum %= mod;
			b[2 * p + 1].sum %= mod;
			b[p].tag = 1;
		}
	}
	void build(int p, int l, int r) {
		b[p].l = l, b[p].r = r;
		b[p].tag = 1;
		if (l == r) {
			b[p].sum = 1;
			return;
		}
		build(2 * p, l, (l + r) >> 1);
		build(2 * p + 1, ((l + r) >> 1) + 1, r);
		update(p);
	}
	inline void change(int p, int l, int r, int w) {
		if (b[p].l >= l && b[p].r <= r) {
			b[p].tag = b[p].tag * w % mod;
			b[p].sum = b[p].sum * w % mod;
			return;
		}
		push_down(p);
		int mid = (b[p].l + b[p].r) >> 1;
		if (r <= mid) change(2 * p, l, r, w);
		else if (l > mid) change(2 * p + 1, l, r, w);
		else {
			change(2 * p, l, mid, w);
			change(2 * p + 1, mid + 1, r, w);
		}
		update(p);
	}
	inline int query(int p, int l, int r) {
		if (b[p].l >= l && b[p].r <= r) {
			return b[p].sum;
		}
		push_down(p);
		int mid = (b[p].l + b[p].r) >> 1;
		if (r <= mid) return query(2 * p, l, r);
		else if (l > mid) return query(2 * p + 1, l, r);
		else {
			return (query(2 * p, l, mid) + query(2 * p + 1, mid + 1, r)) % mod;
		}
	}
} s, t;
int n, m, a[500005], ans;
struct nnode {
	int name, num;
} b[500005];
bool cmp(nnode p, nnode q) {
	return p.num > q.num;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		b[i].name = i;
		b[i].num = a[i];
	}
	sort(b + 1, b + n + 1, cmp);
	s.build(1, 1, n), t.build(1, 1, n);
	int u, v;
	for (int i = 1; i <= n; i++) {
		u = s.query(1, 1, b[i].name) * ksm(s.query(1, b[i].name, b[i].name)) % mod;
		v = t.query(1, b[i].name, n) * ksm(t.query(1, b[i].name, b[i].name)) % mod;
		ans += u * v % mod * b[i].num % mod;
		s.change(1, 1, b[i].name, inv);
		t.change(1,  b[i].name, n, inv);
		ans %= mod;
	}
	ans = ans * inv % mod;
	cout << ans;
}