#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const int MOD = 998244353;
const double pi = acos(-1);
ll gcd(ll a, ll b) {if(b == 0) return a; else return gcd(b,a%b);}
ll lcm(ll a, ll b) {return a*b/gcd(a,b);}

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

template <typename T>
struct RSQ {

    //初期化
    const T INF = numeric_limits<T>::max();
    int n;         // 葉の数
    vector<T> dat; // 完全二分木の配列
    RSQ(int n_) : n(), dat(n_ * 4, 0) { // 葉の数は 2^x の形
        int x = 1;
        while (n_ > x) {
            x *= 2;
        }
        n = x;
    }

    //値の更新
    void update(int i, T x) {
        i += n-1;
        dat[i] += x;
        while(i > 0) {
            i = (i-1)/2;
            dat[i] += x;
        }
    }

    //任意区間の最小値
    // the minimum element of [a,b)
    T query(int a, int b) { return query_sub(a, b, 0, 0, n); }
    T query_sub(int a, int b, int k, int l, int r) {
        if(r <= a || b <= l) return 0;
        else if(a <= l && r <= b) return dat[k];
        else {
            T v1 = query_sub(a,b,2*k+1,l,(l+r)/2);
            T v2 = query_sub(a,b,2*k+2,(l+r)/2,r);
            return v1+v2;
        }
    }
};

using mint = Fp<MOD>;

int main() {
    int n; cin >> n;
    vecl a(n);
    REP(i,n) cin >> a[i];

    ll cnt = 0;
    map<ll,ll> mp;
    vecl b = a;
    sort(b.begin(),b.end());
    REP(i,n) {
        if(!mp.count(b[i])) {
            mp[b[i]] = cnt;
            cnt++;
        }
    }
    //REP(i,n) cout << mp[a[i]] << " ";
    //cout << endl;
    map<ll,ll> mp2;
    
    int m = mp.size();

    RSQ<ll> cntseg1(m), cntseg2(m);
    RSQ<mint> seg1(m), seg2(m);

    mint ans = 0;
    mint total = 0;

    vecl l(n), r(n);
    vector<mint> L(n), R(n);

    REP(i,n) {
        ll sum = cntseg1.query(mp[a[i]]+1, m);
        total = seg1.query(mp[a[i]]+1, m);
        l[i] = sum;
        L[i] = total;
        cntseg1.update(mp[a[i]],1);
        seg1.update(mp[a[i]], a[i]);
    }

    for(int i = n-1; i >= 0; i--) {
        ll sum = cntseg2.query(0,mp[a[i]]);
        total = seg2.query(0,mp[a[i]]);
        R[i] = total;
        r[i] = sum;
        cntseg2.update(mp[a[i]],1);
        seg2.update(mp[a[i]],a[i]);
    }

    REP(i,n) {
        mint x = L[i], y = R[i];
        //cout << i << ":" << l[i] << " "<< r[i] << endl;
        if(r[i] > 0 && l[i] > 0) {
            ans += (mint)l[i] * y + (mint)r[i] * x + (mint)a[i] * ((mint)l[i] * (mint)r[i]);
        }
    }

    cout << ans << endl;
}