class segtree():
  def __init__(self,init,func,ide):
    self.n=len(init)
    self.func=func
    self.ide=ide
    self.size=1<<(self.n-1).bit_length()
    self.tree=[self.ide for i in range(2*self.size)]
    for i in range(self.n):
      self.tree[self.size+i]=init[i]
    for i in range(self.size-1,0,-1):
      self.tree[i]=self.func(self.tree[2*i], self.tree[2*i|1])
  
  def update(self,k,x):
    k+=self.size
    self.tree[k]=x
    k>>=1
    while k:
      self.tree[k]=self.func(self.tree[2*k],self.tree[k*2|1])
      k>>=1
  
  def get(self,i):
    return self.tree[i+self.size]
  
  def query(self,l,r):
    l+=self.size
    r+=self.size
    l_res=self.ide
    r_res=self.ide
    while l<r:
      if l&1:
        l_res=self.func(l_res,self.tree[l])
        l+=1
      if r&1:
        r-=1
        r_res=self.func(self.tree[r],r_res)
      l>>=1
      r>>=1
    return self.func(l_res,r_res)
  
  def debug(self,s=10):
    print([self.get(i) for i in range(min(self.n,s))])

from sys import stdin
input=lambda :stdin.readline()[:-1]

n=int(input())
a=list(map(int,input().split()))

mod=998244353

right1=[0]*n
right2=[0]*n
seg1=segtree([0]*n,lambda x,y:x+y,0)
seg2=segtree([0]*n,lambda x,y:(x+y)%mod,0)

c=[(a[i],i) for i in range(n)]
c.sort(key=lambda x:x[0])
for ai,i in c:
  right1[i]=seg1.query(i,n)
  right2[i]=seg2.query(i,n)
  seg1.update(i,1)
  seg2.update(i,ai)

left1=[0]*n
left2=[0]*n
seg1=segtree([0]*n,lambda x,y:x+y,0)
seg2=segtree([0]*n,lambda x,y:(x+y)%mod,0)

c=c[::-1]
for ai,i in c:
  left1[i]=seg1.query(0,i)
  left2[i]=seg2.query(0,i)
  seg1.update(i,1)
  seg2.update(i,ai)

ans=0
for i in range(n):
  ans+=left1[i]*right2[i]+left2[i]*right1[i]
  ans%=mod
  ans+=a[i]*left1[i]%mod*right1[i]
  ans%=mod

print(ans)