// ＵＴＦ−８

#include<bits/stdc++.h>
/* #include<atcoder/all> */
/* using namespace atcoder; */

using namespace std;
using ll = long long int;
using lc = complex<ll>;

template<class T>bool chmax(T &a, const T &b) { return (a<b ? (a=b,1) : 0); }
template<class T>bool chmin(T &a, const T &b) { return (a>b ? (a=b,1) : 0); }

template <typename T>
struct SegmentTree {
    using F = function<T(T, T)>;

    const T e;
    const F f;
    size_t sz;
    vector<T> tree;

    SegmentTree(size_t n, const F &f, const T &e = 0) : f(f), e(e) {
        sz = 1;
        while(sz < n) sz <<= 1;
        tree.assign(2*sz, e);
    }

    void set(typename vector<T>::iterator begin, typename vector<T>::iterator end) {
        copy(begin, end, tree.begin() + sz);
        for(size_t k=sz-1; k>0; k--)
            tree[k] = f(tree[2*k+0], tree[2*k+1]);
    }

    void update(size_t k, const T &x) {
        k += sz;
        tree[k] = x;
        while(k >>= 1)
            tree[k] = f(tree[2*k+0], tree[2*k+1]);
    }

    T query(size_t a, size_t b) const {
        b = min(b, sz);
        a = max((size_t)0, a);
        T l = e, r = e;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if(a & 1) l = f(l, tree[a++]);
            if(b & 1) r = f(tree[--b], r);
        }
        return f(l, r);
    }

    T operator[](const size_t k) const {
        return tree[sz + k];
    }
};


int main(void) {
    constexpr ll MOD = 0 ? 1e9+7 : 998244353;
    constexpr double PI = acos(-1);
    constexpr double eps = 1e-10;
    cout << fixed << setprecision(32);
    cin.tie(0); ios::sync_with_stdio(false);

    if(1) {
        ll n;
        cin >> n;
        vector<ll> a(n);
        for(auto &e: a) cin >> e;
        vector<ll> b = a;
        sort(begin(b), end(b));
        b.erase(unique(begin(b),end(b)), end(b));

        SegmentTree<pair<ll,ll>> st1(n+10, [&](auto a, auto b) -> pair<ll,ll>{
                auto [x, m] = a;
                auto [y, n] = b;
                return {(x+y)%MOD, (m+n)%MOD};
                }, {0ll, 0ll});
        SegmentTree<pair<ll,ll>> st2(n+10, [&](auto a, auto b) -> pair<ll,ll>{
                auto [x, m] = a;
                auto [y, n] = b;
                return {(x+y)%MOD, (m+n)%MOD};
                }, {0ll, 0ll});

        ll r = 0;
        for(ll i=0; i<n; i++) {
            ll j = lower_bound(begin(b), end(b), a[i]) - begin(b);
            auto [x, y] = st1.query(j+1, n+5);
            auto [z, w] = st2.query(j+1, n+5);
            (r += (z + ((w*a[i])%MOD)) % MOD) %= MOD;
            st2.update(j, {(get<0>(st2[j]) + x+((a[i]*y) % MOD))%MOD, (get<1>(st2[j]) + y) %MOD});
            st1.update(j, {(get<0>(st1[j]) + a[i])%MOD, (get<1>(st1[j]) + 1) %MOD});
            // cout << x << ' ' << y << ' ' << z << ' ' << w << ' ' << r << endl;
        }
        cout << r << endl;
    }

    return 0;
}