#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=998244353,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

class BIT{
public:
  ll n,bit[555555];
  BIT(){fill(bit,bit+555555,0);}
  void add(ll i,ll x){
    while(i<=n){
      bit[i]+=x+MAX;
      bit[i]%=MAX;
      i+=i&-i;
    }
  }
  ll sum(ll i){
    ll s=0;
    while(i>0){
      s+=bit[i]+MAX;
      s%=MAX;
      i-=i&-i;
    }
    return s;
  }
};

BIT t=BIT(),r=BIT(),t2=BIT(),r2=BIT();

void Main() {
  ll n;
  cin >> n;
  ll a[n];
  rep(i,n) R a[i];
  set<ll> s;
  map<ll,ll> m;
  rep(i,n) s.in(a[i]);
  tr(it,s) {
    ll k=m.size()+1;
    m[*it]=k;
  }
  t.n=r.n=t2.n=r2.n=m.size()+1;
  rep(i,n) {
    r.add(m[a[i]],a[i]);
    r2.add(m[a[i]],1);
  }
  ll ans=0;
  rep(i,n) {
    r.add(m[a[i]],-a[i]);
    r2.add(m[a[i]],-1);
    ll x=t2.sum(m.size())-t2.sum(m[a[i]]);
    ll y=r2.sum(m[a[i]]-1);
    ans+=(t.sum(m.size())-t.sum(m[a[i]])+MAX)%MAX*y%MAX;
    ans+=r.sum(m[a[i]]-1)*x%MAX;
    ans+=a[i]*x%MAX*y%MAX;
    ans%=MAX;
    t.add(m[a[i]],a[i]);
    t2.add(m[a[i]],1);
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}