def aa(fen,s,v,c):
	d=1
	while s<len(fen):
		if s&d:
			fen[s][0]+=v
			fen[s][1]+=c
			s+=d
		d<<=1

def bb(fen,s):
	d=1
	q,w=0,0
	while s:
		if s&d:
		  q+=fen[s][0]
		  w+=fen[s][1]
		  s-=d
		d<<=1
	return (q,w)

n=int(input());mod=998244353;ans=0
a=list(map(int,input().split()))
s=set()
for i in a:
	s.add(i)
x={};y={};z=len(s)
for i,j in enumerate(sorted(list(s))):
	x[j]=i+1
	y[j]=z-i
fen1=[[0,0] for i in range(z+1)]
fen2=[[0,0] for i in range(z+1)]
for i in a:
  aa(fen2,x[i],i,1)
for i in a:
  q,w=bb(fen2,x[i]-1),bb(fen1,y[i]-1)
  ans+=q[0]*w[1]%mod+q[1]*w[0]%mod+i*q[1]*w[1]%mod
  ans%=mod
  aa(fen2,x[i],-i,-1)
  aa(fen1,y[i],i,1)
print(ans)