#include<bits/stdc++.h>
#include<atcoder/fenwicktree>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
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;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    VI a(n);
    rep(i, n) cin >> a[i];
    map<int,int> mp;
    rep(i, n) mp[a[i]] = 0;
    {
        int idx = 0;
        for(auto& [k, v]: mp) v = idx++;
    }
    int sz = mp.size();
    mint ans = 0;
    {
        fenwick_tree<ll> ft1(sz), ft2(sz);
        rep(i, n) {
            int idx = mp[a[i]];
            ll cnt1 = ft1.sum(idx + 1, sz);
            ll cnt2 = ft2.sum(idx + 1, sz);
            ans += cnt2 * a[i];
            ft2.add(idx, cnt1);
            ft1.add(idx, 1);
        }
    }
    {
        fenwick_tree<ll> ft1(sz), ft2(sz);
        rrep(i, n) {
            int idx = mp[a[i]];
            ll cnt1 = ft1.sum(0, idx);
            ll cnt2 = ft2.sum(0, idx);
            ans += mint(cnt2) * a[i];
            ft2.add(idx, cnt1);
            ft1.add(idx, 1);
        }
    }
    {
        fenwick_tree<ll> ft1(sz), ft2(sz);
        rrep(i, n) {
            int idx = mp[a[i]];
            ft2.add(idx, 1);
        }
        rep(i, n) {
            int idx = mp[a[i]];
            ans += mint(a[i]) * ft1.sum(idx + 1, sz) * ft2.sum(0, idx);
            ft1.add(idx, 1);
            ft2.add(idx, -1);
        }
    }
    cout << ans.val() << endl;
}