#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
const int inv = 998244353+1>>1;
int qp(int p,int q){
	int ans = 1,pro = p;
	while(q){
		if(q&1)ans = ans*pro%mod;
		q>>=1;pro = pro*pro%mod;
	}return ans;
}int niyuan(int x){
	return qp(x,mod-2);
}struct node{
	int l,r;int lazy = 1,sum = 0;
	void add(int x){
		lazy = lazy*x%mod;sum = sum*x%mod;return;
	}
}tree1[2000005],tree2[2000005];
inline void push_down1(int k){
	if(tree1[k].lazy!=1)tree1[k<<1].add(tree1[k].lazy),tree1[k<<1|1].add(tree1[k].lazy),tree1[k].lazy = 1;return;
}inline void push_down2(int k){
	if(tree2[k].lazy!=1)tree2[k<<1].add(tree2[k].lazy),tree2[k<<1|1].add(tree2[k].lazy),tree2[k].lazy = 1;return;
}inline void push_up1(int k){
	tree1[k].sum = (tree1[k<<1].sum+tree1[k<<1|1].sum)%mod;
}inline void push_up2(int k){
	tree2[k].sum = (tree2[k<<1].sum+tree2[k<<1|1].sum)%mod;
}inline void build1(int l,int r,int k){
	tree1[k].l = l,tree1[k].r = r;
	if(l+1 == r){
		tree1[k].sum = 1;return;
	}build1(l,l+r>>1,k<<1),build1(l+r>>1,r,k<<1|1);push_up1(k);
}inline void build2(int l,int r,int k){
	tree2[k].l = l,tree2[k].r = r;
	if(l+1 == r){
		tree2[k].sum = 1;return;
	}build2(l,l+r>>1,k<<1),build2(l+r>>1,r,k<<1|1);push_up2(k);
}inline void upd1(int k,int pos){
	int l = tree1[k].l,r = tree1[k].r;
	if(pos>=r)return;
	if(l>=pos){
		tree1[k].add(2);return;
	}push_down1(k);upd1(k<<1,pos);upd1(k<<1|1,pos);push_up1(k);
}inline void upd2(int k,int pos){
	int l = tree2[k].l,r = tree2[k].r;
	if(pos>=r)return;
	if(l>=pos){
		tree2[k].add(inv);return;
	}push_down2(k);upd2(k<<1,pos);upd2(k<<1|1,pos);push_up2(k);
}inline int query1(int l,int r,int k){
	int ll = tree1[k].l,rr = tree1[k].r;
	if(l>=rr or ll>=r)return 0;
	if(l<=ll and rr<=r)return tree1[k].sum;push_down1(k);
	return (query1(l,r,k<<1)+query1(l,r,k<<1|1))%mod;
}inline int query2(int l,int r,int k){
	int ll = tree2[k].l,rr = tree2[k].r;
	if(l>=rr or ll>=r)return 0;
	if(l<=ll and rr<=r)return tree2[k].sum;push_down2(k);
	return (query2(l,r,k<<1)+query2(l,r,k<<1|1))%mod;
}
int a[500005];
vector<pair<int,int> >p;
int n;
signed main(){
	ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
	cin >> n;
	for(int i = 1;i<=n;i++)cin >> a[i];
	for(int i = 1;i<=n;i++)p.push_back({a[i],i});
	build1(1,n+1,1),build2(1,n+1,1);
	//cout << 111 << endl;
	int ans = 0;
	sort(p.begin(),p.end());reverse(p.begin(),p.end());
	for(int i =0;i<p.size();i++){
		int id = p[i].second;
	//	cout << " " << id << " " << p[i].first << endl;
		if(id!=n)upd1(1,id+1);upd2(1,id);
		int q1 = query2(id,n+1,1),q2 = query1(1,id+1,1);
	//	cout << q1 << " " << niyuan(q2) << endl;
	//	cout << niyuan(q1) << " " << q2 << endl;cout << endl;
		ans = (ans+p[i].first*q1%mod*q2%mod)%mod;
	}cout << ans << endl;
	return 0;
}/*
      ******       ******
    **********   **********
  ************* *************
 *****************************
 *****************************
 *****************************
  ***************************
    ***********************
      *******************
        ***************
          ***********
            *******
              ***
               *
*/