# 0-indexed binary indexed tree
class BIT:
  def __init__(self, n):
    self.n = n
    self.data = [0]*(n+1)
    self.el = [0]*(n+1)
  # sum of [0,i) sum(a[:i])
  def sum(self, i):
    if i==0:return 0
    s = 0
    while i > 0:
      s += self.data[i]
      i -= i & -i
    return s
  def add(self, i, x):
    i+=1
    self.el[i] += x
    while i <= self.n:
      self.data[i] += x
      i += i & -i
  # sum of [l,r)   sum(a[l:r])
  def sumlr(self, i, j):
    return self.sum(j) - self.sum(i)
  # a[i]
  def get(self,i):
    i+=1
    return self.el[i]
def main1(n,a):
  mod=998244353
  aa=a[:]
  aa.sort()
  d={x:i for i,x in enumerate(aa)}
  bit1n=BIT(n)
  bit1s=BIT(n)
  bit2n=BIT(n)
  bit2s=BIT(n)
  bit3n=BIT(n)
  bit3s=BIT(n)
  for x in a:
    idx=d[x]
    bit1n.add(idx,1)
    bit1s.add(idx,x)

    n2=bit1n.sumlr(idx+1,n)%mod
    bit2n.add(idx,n2)
    bit2s.add(idx,bit1s.sumlr(idx+1,n)%mod+x*n2)
    
    n3=bit2n.sumlr(idx+1,n)%mod
    bit3n.add(idx,n3)
    bit3s.add(idx,bit2s.sumlr(idx+1,n)%mod+x*n3)
  return bit3s.sum(n)%mod


if __name__=='__main__':
  n=int(input())
  a=list(map(int,input().split()))
  ret1=main1(n,a)
  print(ret1)