#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
using ll = long long;

ll MOD = 998244353;

class BIT{
	public:
	vector<ll>tree;
	int n;
	BIT(int n){
		this->n = n;
		tree.assign(n+1,0);
	}
	void add(int a,ll w){
		a++;
		for(int x=a;x<=n;x += x&-x)(tree[x] += w)%=MOD;
	}
	ll sum(int a){
		if(a==0)return 0;
		ll ret = 0;
		for(int x = a; x>0; x -= x&-x)(ret+=tree[x])%=MOD;
		return ret;
	}
};

int main()
{
	int n;
	cin >> n;
	vector<ll> a(n);
	map<int,int> atoidx,idxtoa;
	vector<ll> l(n),x(n),r(n),y(n);
	for(auto &i:a)cin >> i;
	{
		set<int> zaatu;
		for(auto &i:a)zaatu.insert(i);
		int idx = 0;
		for(auto &i:zaatu){
			atoidx[i]=idx;
			idxtoa[idx]=i;
			idx++;
		}
		BIT bitlr(n),bitxy(n);
		for(int i = 0;i<n;i++){
			ll idx = n-1-atoidx[a[i]];
			//cout<<idx<<endl;
			bitlr.add(idx,1);
			bitxy.add(idx,a[i]);
			l[i]=bitlr.sum(idx);
			x[i]=bitxy.sum(idx);
		}
		//for(auto &i:l)cout<<i<<' ';cout<<endl;
		//for(auto &i:x)cout<<i<<' ';cout<<endl;
		bitlr = BIT(n);bitxy=BIT(n);
		for(int i = n-1;i>=0;i--){
			ll idx = atoidx[a[i]];
			bitlr.add(idx,1);
			bitxy.add(idx,a[i]);
			r[i]=bitlr.sum(idx);
			y[i]=bitxy.sum(idx);
		}
		//for(auto &i:r)cout<<i<<' ';cout<<endl;
		//for(auto &i:y)cout<<i<<' ';cout<<endl;
	}
	ll ans = 0;

	for(int i = 0;i<n;i++){
		if(l[i]==0||r[i]==0)continue;
		(ans += x[i]*r[i])%=MOD;
		(ans += y[i]*l[i])%=MOD;
		(ans += a[i]*(l[i]*r[i]%MOD))%=MOD;
	}

	cout<<ans<<endl;
}