#include <bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const ll mod = 998244353;
struct node {
	int l, r;
	ll tag, sum;
};
int n, a[500005], re[500005], rre[500005];
ll ans;
struct nnode {
	int name, num;
} c[500005];
struct XDT {
	node b[2000006];
	inline void update(int p) {
		b[p].sum = (b[2 * p].sum + b[2 * p + 1].sum) % mod;
	}
	inline void push_down(int p) {
		if (b[p].tag != 1) {
			b[2 * p].sum = b[2 * p].sum * b[p].tag % mod;
			b[2 * p].tag = b[2 * p].tag * b[p].tag % mod;
			b[2 * p + 1].sum = b[2 * p + 1].sum * b[p].tag % mod;
			b[2 * p + 1].tag = b[2 * p + 1].tag * b[p].tag % mod;
			b[p].tag = 1;
		}
	}
	inline void build(int p, int l, int r) {
		b[p].l = l;
		b[p].r = r;
		b[p].tag = b[p].sum = 0;
		b[p].tag = 1;
		if (l == r) return;
		build(2 * p, l, (l + r) >> 1);
		build(2 * p + 1, ((l + r) >> 1) + 1, r);
	}
	inline void add(int p, int l, int r) {
		if (l > r) return;
		if (b[p].l >= l && b[p].r <= r) {
			b[p].sum = b[p].sum * 2 % mod;
			b[p].tag = b[p].tag * 2 % mod;
			return;
		}
		push_down(p);
		int mid = (b[p].l + b[p].r) >> 1;
		if (r <= mid) add(2 * p, l, r);
		else if (l > mid) add(2 * p + 1, l, r);
		else {
			add(2 * p, l, mid);
			add(2 * p + 1, mid + 1, r);
		}
		update(p);
	}
	inline void change(int p, int q, int w) {
		if (b[p].l == b[p].r) {
			b[p].sum = b[p].sum * w % mod;
			return;
		}
		push_down(p);
		if (q <= (b[p].l + b[p].r) / 2) {
			change(2 * p, q, w);
		} else {
			change(2 * p + 1, q, w);
		}
		update(p);
	}
	inline void init(int p, int q, int w) {
		if (b[p].l == b[p].r) {
			b[p].sum = w;
			return;
		}
		push_down(p);
		if (q <= (b[p].l + b[p].r) / 2) {
			init(2 * p, q, w);
		} else {
			init(2 * p + 1, q, w);
		}
		update(p);
	}
	inline ll query(int p, int l, int r) {
		if (l > r) return 0;
		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;
		}
	}
} l, r;
inline ll ksm(ll p, ll q) {
	ll base = 1;
	while (q) {
		if (q & 1) base = base * p % mod;
		q >>= 1;
		p = p * p % mod;
	}
	return base;
}
bool comp1(nnode p, nnode q) {
	return p.num < q.num;
}
bool comp2(nnode p, nnode q) {
	return p.num > q.num;
}
inline int lowbit(int p) {
	return p & -p;
}
int t[500005];
inline void add(int p, int q) {
	while (p <= n) {
		t[p] += q;
		p += lowbit(p);
	}
}
inline int query(int p) {
	int cnt = 0;
	while (p >= 1) {
		cnt += t[p];
		p -= lowbit(p);
	}
	return cnt;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	re[0] = 1;
	rre[0] = 1;
	for (int i = 1; i <= n; i++) {
		re[i] = re[i - 1] * 2 % mod;
		rre[i] = rre[i - 1] * 499122177 % mod;
	}
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		c[i] = nnode{i, a[i]};
	}
	l.build(1, 1, n), r.build(1, 1, n);
	sort(c + 1, c + n + 1, comp1);
	int u, v;
	for (int i = 1; i <= n; i++) {
		u = query(c[i].name - 1);
		v = i - 1 - u;
		r.add(1, c[i].name + 1, n);
		l.add(1, 1, c[i].name - 1);
		r.init(1, c[i].name, (n - c[i].name + 1)*re[u] % mod);
		l.init(1, c[i].name, c[i].name * (re[v]) % mod);
		add(c[i].name, 1);
		ans += c[i].num * (r.query(1, c[i].name + 1, n) * rre[u + 1] % mod + r.query(1, c[i].name, c[i].name) * rre[u] % mod ) % mod * (l.query(1, 1, c[i].name - 1) * rre[v + 1] % mod + l.query(1, c[i].name, c[i].name) * rre[v] % mod ) % mod;
		ans %= mod;
	}
//	cout << ans << "[]";
	l.build(1, 1, n), r.build(1, 1, n);
	memset(t, 0, sizeof(t));
	sort(c + 1, c + n + 1, comp2);
	for (int i = 1; i <= n; i++) {
		u = query(c[i].name - 1);
		v = i - 1 - u;
		r.add(1, c[i].name + 1, n);
		l.add(1, 1, c[i].name - 1);
		r.init(1, c[i].name, (n - c[i].name + 1)*re[u] % mod);
		l.init(1, c[i].name, c[i].name * (re[v]) % mod);
		add(c[i].name, 1);
		ans += mod - c[i].num * (r.query(1, c[i].name + 1, n) * rre[u + 1] % mod + r.query(1, c[i].name, c[i].name) * rre[u] % mod ) % mod * (l.query(1, 1, c[i].name - 1) * rre[v + 1] % mod + l.query(1, c[i].name, c[i].name) * rre[v] % mod ) % mod;
		ans %= mod;
	}
	cout << ans;
}