# Binary Indexed Tree (Fenwick Tree)
class BIT:
  def __init__(self, n):
    self.n = n
    self.bit = [0]*(n+1)
    self.el = [0]*(n+1)
  def sum(self, i):
    s = 0
    while i > 0:
      s += self.bit[i]
      i -= i & -i
    return s
  def add(self, i, x):
    # assert i > 0
    self.el[i] += x
    while i <= self.n:
      self.bit[i] += x
      i += i & -i
  def get(self, i, j=None):
    if j is None:
      return self.el[i]
    return self.sum(j) - self.sum(i-1)
  def lower_bound(self,x):
    w = i = 0
    k = 1<<((self.n).bit_length())
    while k:
      if i+k <= self.n and w + self.bit[i+k] < x:
        w += self.bit[i+k]
        i += k
      k >>= 1
    return i+1
N = int(input())
total1 = BIT(N+1)
total2 = BIT(N+1)
total3 = BIT(N+1)
cnt1 = BIT(N+1)
cnt2 = BIT(N+1)
cnt3 = BIT(N+1)
A = list(map(int, input().split()))
comp = lambda arr: {e: i+1 for i, e in enumerate(sorted(set(arr)))}
compA = comp(A)
MOD = 998244353
A = A[::-1]
for i in range(N):
  total1.add(compA[A[i]], A[i])
  cnt1.add(compA[A[i]], 1)
  p = total1.sum(compA[A[i]]-1)
  q = cnt1.sum(compA[A[i]]-1)
  total2.add(compA[A[i]], (p+q*A[i])%MOD)
  cnt2.add(compA[A[i]], q%MOD)
  p = total2.sum(compA[A[i]]-1)
  q = cnt2.sum(compA[A[i]]-1)
  total3.add(compA[A[i]], (p+q*A[i])%MOD)
  cnt3.add(compA[A[i]], q%MOD)
print(total3.sum(N+1)%MOD)