#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define eps 1e-8
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int lowbit(int x){
	return (x&(-x));
}
ll cs[2][2000005],cp[2][2000005],sum[2][2000005];
int n;
pair<int,int> a[500005];
#define mod 998244353
int p2[500005];
void pushup(int d,int x){
	cs[d][x]=(cs[d][x<<1]*p2[sum[d][x<<1|1]]+cs[d][x<<1|1])%mod;
	cp[d][x]=(cp[d][x<<1]+p2[sum[d][x<<1]]*cp[d][x<<1|1])%mod;
	sum[d][x]=sum[d][x<<1]+sum[d][x<<1|1];
}
void build(int l,int r,int x){
	if(l==r){
		cp[0][x]=cs[0][x]=1;
		cp[1][x]=cs[1][x]=2;
		sum[0][x]=0;
		sum[1][x]=1;
		return;
	}
	int mid=(l+r)/2;
	build(l,mid,x<<1);
	build(mid+1,r,x<<1|1);
	pushup(0,x);
	pushup(1,x);
}
void upd(int l,int r,int x,int pos,int d){
	if(l==r){
		cp[d][x]=cs[d][x]=p2[1-d];
		sum[d][x]=1-d;
		return;
	}
	int mid=(l+r)/2;
	if(pos<=mid)upd(l,mid,x<<1,pos,d);
	else upd(mid+1,r,x<<1|1,pos,d);
	pushup(d,x);
}
int querysum(int l,int r,int x,int L,int R,int d){
	if(L<=l && r<=R)return sum[d][x];
	int mid=(l+r)/2;
	int ans=0;
	if(L<=mid)ans+=querysum(l,mid,x<<1,L,R,d);
	if(R>mid)ans+=querysum(mid+1,r,x<<1|1,L,R,d);
	return ans;
}
ll querys(int l,int r,int x,int L,int R,int d){
	if(L>R)return 0;
	if(L<=l && r<=R)return cs[d][x];
	int mid=(l+r)/2;
	if(R<=mid)return querys(l,mid,x<<1,L,R,d);
	if(L>mid)return querys(mid+1,r,x<<1|1,L,R,d);
	return (querys(l,mid,x<<1,L,R,d)*p2[querysum(mid+1,r,x<<1|1,L,R,d)]+querys(mid+1,r,x<<1|1,L,R,d))%mod;
}
ll queryp(int l,int r,int x,int L,int R,int d){
	if(L>R)return 0;
	if(L<=l && r<=R)return cp[d][x];
	int mid=(l+r)/2;
	if(R<=mid)return queryp(l,mid,x<<1,L,R,d);
	if(L>mid)return queryp(mid+1,r,x<<1|1,L,R,d);
	return (queryp(l,mid,x<<1,L,R,d)+p2[querysum(l,mid,x<<1,L,R,d)]*queryp(mid+1,r,x<<1|1,L,R,d))%mod;
}
void output(int l,int r,int x){
	printf("output l=%d,r=%d\n",l,r);
	printf("cs0=%d,cs1=%d,cp0=%d,cp1=%d\n",cs[0][x],cs[1][x],cp[0][x],cp[1][x]);
	printf("sum0=%d,sum1=%d\n",sum[0][x],sum[1][x]);
	if(l==r)return;
	int mid=(l+r)/2;
	output(l,mid,x<<1);
	output(mid+1,r,x<<1|1);
}
int tmp[500005];
int main(){
	scanf("%d",&n);
	p2[0]=1;
	for(int i=1;i<=n;i++)p2[i]=1LL*p2[i-1]*2%mod;
	for(int i=1;i<=n;i++)scanf("%d",&a[i].first);
	for(int i=1;i<=n;i++)a[i].second=i;
	sort(a+1,a+n+1);
	// for(int i=1;i<=n;i++)printf("%d ",a[i].second);
	// printf("\n");
	int ans=0;
	build(1,n,1);
	// output(1,n,1);
	for(int i=1;i<=n;i++){
		int p=a[i].second;
		// printf("%d %d\n",i,p);
		upd(1,n,1,p,0);
		ans=(ans+1LL*(querys(1,n,1,1,p-1,0)+1)*(queryp(1,n,1,p+1,n,0)+1)%mod*a[i].first%mod)%mod;
		ans=(ans-1LL*(querys(1,n,1,1,p-1,1)+1)*(queryp(1,n,1,p+1,n,1)+1)%mod*a[i].first%mod+mod)%mod;
		// printf("add %d %d mns %d %d\n",querys(1,n,1,1,p-1,0),queryp(1,n,1,p+1,n,0),querys(1,n,1,1,p-1,1),queryp(1,n,1,p+1,n,1));
		// if(i==4)output(1,n,1);
		upd(1,n,1,p,1);
	}
	printf("%d",ans);
	return 0;
}
//quod erat demonstrandum