#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],pw[1000005];
struct tree{
	int l,r;
	int pre,suf;
	int lazy1 = 0,lazy2 = 0,tot1 = 0,tot2 = 0;
	void add1(int x){
		pre = pre*pw[x]%mod;
		lazy1+=x,tot1+=x;
	}void add2(int x){
		suf = suf*pw[x]%mod;
		lazy2+=x,tot2+=x;
	}
}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)tree[k<<1].add1(tree[k].lazy1),tree[k<<1|1].add1(tree[k].lazy1),tree[k].lazy1 = 0;
	if(tree[k].lazy2)tree[k<<1].add2(tree[k].lazy2),tree[k<<1|1].add2(tree[k].lazy2),tree[k].lazy2 = 0;
}
void build(int l,int r,int k){
	tree[k].l = l,tree[k].r = r;tree[k].tot1 = tree[k].tot2 = 0;
	tree[k].pre = tree[k].suf =0 ;tree[k].lazy1 = tree[k].lazy2 = 0;
	if(l+1 == r){return;}
	build(l,l+r>>1,k<<1),build(l+r>>1,r,k<<1|1);
}inline void upd1(int l,int r,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(1);return;
	}push_down(k),upd1(l,r,k<<1),upd1(l,r,k<<1|1);push_up(k);
}inline void upd2(int l,int r,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(1);return;
	}push_down(k),upd2(l,r,k<<1),upd2(l,r,k<<1|1);push_up(k);
}inline 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*pw[tree[k].tot1]%mod,tree[k].suf = (n-pos+1)*pw[tree[k].tot2]%mod;return;
	}push_down(k);
	if(pos<mid)nrd(pos,k<<1);
	else nrd(pos,k<<1|1);
	push_up(k);
}
inline int query1(int pos){
	int l = 1,r=n+1,k = 1,ans =0;
	while(l+1!=r){push_down(k);
		int mid =l+r>>1;
		if(pos>=mid)ans = (ans+tree[k<<1].pre),k = k<<1|1,l = mid;
		else k = k<<1,r = mid;
	}return ans%mod;
}inline int query2(int pos){
	int l = 1,r = n+1,k = 1,ans =0;
	while(l+1!=r){push_down(k);
		int mid = l+r>>1;
		if(pos<=mid)ans = (ans+tree[k<<1|1].suf),k = k<<1,r = mid;
		else k = k<<1|1,l = mid;
	}return ans%mod;
}/*
inline 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;
}inline 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(){srand(time(0));
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin >> n;for(int i = 1;i<=n;i++)cin >> a[i];
//	cin >> n;
//n = 500000;
inv2[0] = 1;for(int i = 1;i<=n;i++)inv2[i] = inv2[i-1]*inv%mod;
//	for(int i= 1;i<=n;i++)a[i] = rand();
	pw[0] =1;for(int i = 1;i<=n;i++)pw[i] = pw[i-1]*2%mod;
	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);
		ans+=query1(pos+1)*query2(pos)%mod*val%mod*inv2[i]%mod;ans%=mod;
		upd1(1,pos,1),upd2(pos+1,n+1,1);
	}
	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);
		ans-=query1(pos+1)*query2(pos)%mod*val%mod*inv2[i]%mod;ans%=mod;ans +=mod;ans%=mod;
		upd1(1,pos,1),upd2(pos+1,n+1,1);
	}cout << ans << endl;
	
	return 0;
}/*
3
2 3 1 
*/