#include <bits/stdc++.h>
//#include <atcoder/modint.hpp>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
//const int mod= int(1e9)+7;
const int mod2=998244353;
using P = pair<int,int>;
using Pl= pair<ll,ll>;
using ld=long double;
using V=vector<int>;
using Vl=vector<ll>;
using Vd=vector<ld>;
using VV=vector<vector<int>>;
using VVl=vector<vector<ll>>;
using VVd=vector<vector<ld>>;
//using mint=atcoder::modint1000000007;

// modint: mod 計算を int を扱うように扱える構造体
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;
    }
};
using mint = Fp<mod2>;

template <class T>
vector<T> press(vector<T> &x){
    auto res=x;
    sort(all(res));
    res.erase(unique(all(res)),res.end());
    for(auto &xx:x){
        xx=lower_bound(all(res),xx)-res.begin();
    }
    return res;
}

template <typename T>
struct BIT{
private:
    int n;
    vector<T>d;
public:
    BIT()=default;
    BIT(int n):n(n),d(n+1,0){}
    void add(int a,T w=1){ //tmp.add(i)がadd(i,1)となるように
        for(a++;a<=n;a+=a&-a)d[a]+=w;
    }
    T sum(int a){//[0,a)
        T ret=0;
        for(;a;a-=a&-a)ret+=d[a];
        return ret;
    }
    T sum(int l,int r){//[l,r)
        return sum(r)-sum(l);
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;cin >>n;
    V a(n);
    for (int i = 0; i < n; ++i) {
        cin >>a[i];
    }
    auto rec=press(a);
    int m=rec.size();
    vector<mint>x(n),y(n);
    V l(n),r(n);
    {
        BIT<mint>bit(m+1);
        BIT<int>k(m+1);
        for (int i = 0; i < n; ++i) {
            bit.add(a[i],rec[a[i]]);
            k.add(a[i]);
            x[i]=bit.sum(a[i]+1,m);
            l[i]=k.sum(a[i]+1,m);
        }
    }
    {
        BIT<mint>bit(m+1);
        BIT<int>k(m+1);
        for(int i=n-1;i>=0;i--){
            bit.add(a[i],rec[a[i]]);
            k.add(a[i]);
            y[i]=bit.sum(a[i]);
            r[i]=k.sum(a[i]);
        }
    }
    mint ans=0;
    for (int i = 0; i < n; ++i) {
//        cout <<"i= "<<i<<" l "<<l[i]<<" r "<<r[i]<<"\n";
        if(l[i]*r[i]==0)continue;
        mint tmp=rec[a[i]];
        ans+=x[i]*r[i]+y[i]*l[i]+tmp*l[i]*r[i];
    }
    cout <<ans<<"\n";
    return 0;
}