#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define all(x) x.begin(), x.end()
#define lb(a, x) lower_bound(all(a), x) - a.begin()
using namespace std;
using namespace atcoder;
using ll = long long;
template <class T>	using V = vector<T>;
template <class T>	using VV = V<V<T> >;
template <class T>	using BIT = fenwick_tree<T>;
const ll MOD = 998244353;


int main(void) {
	int n;	cin >> n;
	V<ll> a(n);		V<ll> b(n);
	rep(i, 0, n) {
		cin >> a[i];
	}

	V<ll> s = a;	sort(all(s));
	s.erase(unique(all(s)), s.end());
	rep(i, 0, a.size()) {
		a[i] = lb(s, a[i]);
		b[i] = s.size() - 1 - a[i];
	}

	BIT<ll> lbt(n);		V<ll> lcnt(n);
	BIT<ll> rbt(n);		V<ll> rcnt(n);
	rep(i, 0, n) {
		int k = n - 1 - i;
		lbt.add(a[i], 1);
		rbt.add(b[k], 1);
		lcnt[i] = lbt.sum(0, a[i]);
		rcnt[k] = rbt.sum(0, b[k]);
	}
	
	BIT<ll> bt(n);		ll ans = 0;
	rep(i, 0, n) {
		bt.add(b[i], lcnt[i]);
		ans += bt.sum(0, b[i]) * rcnt[i];
		ans %= MOD;
	}
			
	cout << ans << endl;
}