#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) x&(-x)
int n;
int a[500005];
const int mod = 998244353;
const int inv = mod+1>>1;
const int N = 500005;
int inv2[1000005];
int Tree1[500010],Tree2[500010];
void Upd1(int pos,int add){
	for(int i = pos;i<N;i+=lowbit(i))Tree1[i]+=add;
}void Upd2(int pos,int add){
	for(int i = pos;i<N;i+=lowbit(i))Tree2[i]+=add;
}int Query1(int pos){
	int res = 0;for(int i = pos;i>0;i-=lowbit(i))res+=Tree1[i];return res;
}int Query2(int pos){
	int res = 0;for(int i= pos;i>0;i-=lowbit(i))res+=Tree2[i];return res;
}
struct tree{
	int l,r;
	int pre,suf;
	int lazy1 = 1,lazy2 = 1,tot1 = 1,tot2 = 1;
	void add1(int x){
		lazy1*=x,pre*=x;tot1*=x;
		lazy1%=mod,pre%=mod;tot1%=mod;
	}void add2(int x){
		lazy2*=x,suf*=x;tot2*=x;
		lazy2%=mod,suf%=mod;tot2%=mod;
	}
}tree[2000005];
void push_up(int k){
	tree[k].pre = tree[k<<1].pre+tree[k<<1|1].pre;
	if(tree[k].pre>mod)tree[k].pre-=mod;
	tree[k].suf = tree[k<<1].suf+tree[k<<1|1].suf;
	if(tree[k].suf>mod)tree[k].suf-=mod;
}void push_down(int k){
	if(tree[k].lazy1!=1)tree[k<<1].add1(tree[k].lazy1),tree[k<<1|1].add1(tree[k].lazy1),tree[k].lazy1 = 1;
	if(tree[k].lazy2!=1)tree[k<<1].add2(tree[k].lazy2),tree[k<<1|1].add2(tree[k].lazy2),tree[k].lazy2 = 1;
}
void build(int l,int r,int k){
	//cout << l << " " << r << " " << k << endl;
	tree[k].l = l,tree[k].r = r;tree[k].tot1 = tree[k].tot2 = 1;
	tree[k].pre = tree[k].suf =0 ;tree[k].lazy1 = tree[k].lazy2 = 1;
	if(l+1 == r){return;}
	build(l,l+r>>1,k<<1),build(l+r>>1,r,k<<1|1);
}void upd1(int l,int r,int add,int k){
	int ll = tree[k].l,rr = tree[k].r;
	if(l>=rr or ll>=r)return;
	if(l<=ll and rr<=r){
		tree[k].add1(add);return;
	}push_down(k),upd1(l,r,add,k<<1),upd1(l,r,add,k<<1|1);push_up(k);
}void upd2(int l,int r,int add,int k){
	int ll = tree[k].l,rr = tree[k].r;
	if(l>=rr or ll>=r)return;
	if(l<=ll and rr<=r){
		tree[k].add2(add);return;
	}push_down(k),upd2(l,r,add,k<<1),upd2(l,r,add,k<<1|1);push_up(k);
}void nrd(int pos,int k){
	int l = tree[k].l,r = tree[k].r,mid = l+r>>1;
	if(l+1 == r){
		tree[k].pre = pos*tree[k].tot1%mod,tree[k].suf = (n-pos+1)*tree[k].tot2%mod;return;
	}push_down(k);
	if(pos<mid)nrd(pos,k<<1);
	else nrd(pos,k<<1|1);
	push_up(k);
}int query1(int l,int r,int k){
	int ll = tree[k].l,rr = tree[k].r;
	if(ll>=r or l>=rr)return 0;
	if(l<=ll and rr<=r)return tree[k].pre;
	push_down(k);return (query1(l,r,k<<1)+query1(l,r,k<<1|1))%mod;
}int query2(int l,int r,int k){
	int ll = tree[k].l,rr = tree[k].r;
	if(ll>=r or l>=rr)return 0;
	if(l<=ll and rr<=r)return tree[k].suf;
	push_down(k);return (query2(l,r,k<<1)+query2(l,r,k<<1|1))%mod;
}
vector<pair<int,int> >p;
bool cmp(pair<int,int>a,pair<int,int>b){
	return a.first<b.first;
}
signed main(){
	cin >> n;inv2[0] = 1;for(int i = 1;i<=2*n;i++)inv2[i] = inv2[i-1]*inv%mod;
	for(int i= 1;i<=n;i++)cin >> a[i];
	for(int i = 1;i<=n;i++){
		p.push_back({a[i],i});
	}sort(p.begin(),p.end(),cmp);build(1,n+1,1);
	int ans = 0;
	for(int i =0;i<p.size();i++){
		int pos = p[i].second,val = p[i].first;
		nrd(pos,1);
	//	cout << pos << endl;
		//cout << query1(1,pos+1,1) << " " << query2(pos,n+1,1) << endl;
		//cout << " "<< query1(1,pos+1,1)*query2(pos,n+1,1)%mod*val << " " << query1(1,pos+1,1)*query2(pos,n+1,1)%mod*val%mod*inv2[i]%mod << endl;
		ans+=query1(1,pos+1,1)*query2(pos,n+1,1)%mod*val%mod*inv2[i]%mod;ans%=mod;
		//cout << query2(1,n+1,1) << endl;
		//for(int j = 1;j<=n;j++)cout << query2(j,j+1,1) << " ";cout << endl;
		upd1(1,pos,2,1),upd2(pos+1,n+1,2,1);
		//;ans+=pos*(n-pos+1)*a[i]%mod;
	}//cout << ans << endl;
	reverse(p.begin(),p.end());build(1,n+1,1);
	for(int i =0;i<p.size();i++){
		int pos = p[i].second,val = p[i].first;
		nrd(pos,1);
	//	cout << pos << endl;
		//cout << query1(1,pos+1,1) << " " << query2(pos,n+1,1) << endl;
		//cout << " "<< query1(1,pos+1,1)*query2(pos,n+1,1)%mod*val << " " << query1(1,pos+1,1)*query2(pos,n+1,1)%mod*val%mod*inv2[i]%mod << endl;
		ans-=query1(1,pos+1,1)*query2(pos,n+1,1)%mod*val%mod*inv2[i]%mod;ans%=mod;ans +=mod;ans%=mod;
		//cout << query2(1,n+1,1) << endl;
		//for(int j = 1;j<=n;j++)cout << query2(j,j+1,1) << " ";cout << endl;
		upd1(1,pos,2,1),upd2(pos+1,n+1,2,1);
		//;ans+=pos*(n-pos+1)*a[i]%mod;
	}cout << ans << endl;
	
	return 0;
}/*
3
2 3 1 
*/