class BIT: #0-indexed
    __slots__ = ["size", "tree","depth","n0"]
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
        self.depth = n.bit_length()
        self.n0 = 1<<self.depth

    def get_sum(self, i): #a_0 + ... + a_{i} #閉区間
        s = 0; i += 1
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def range_sum(self,l,r): #a_l + ... + a_r 閉区間
        return self.get_sum(r) - self.get_sum(l-1) 

    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

    def bisect_left(self,w):
        #和が w 以上になる最小の index
        #w が存在しない場合 self.size を返す
        if w <= 0: return 0
        x,k = 0,self.n0
        for _ in range(self.depth):
            k >>= 1
            if x+k <= self.size and self.tree[x+k] < w:
                w -= self.tree[x+k]
                x += k
        return x

# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline

#n = int(readline())
n, = map(int,readline().split())
*a, = map(int,readline().split())

MOD = 998244353
sa = list(sorted(set(a)))
d = {ai:i for i,ai in enumerate(sa)}

num = BIT(n)
val = BIT(n)

nres = [0]*n
vres = [0]*n
for i,ai in enumerate(a):
    idx = d[ai]
    nres[i] = num.range_sum(idx+1,n-1)
    vres[i] = val.range_sum(idx+1,n-1)
    num.add(idx,1)
    val.add(idx,ai)

#print(nres,vres)
    
ans = 0
num = BIT(n)
val = BIT(n)
for i in range(n-1,-1,-1):
    ai = a[i]
    idx = d[ai]
    x = num.get_sum(idx-1)
    y = val.get_sum(idx-1)
    num.add(idx,1)
    val.add(idx,ai)
    
    ans += ai*nres[i]*x
    ans += x*vres[i]
    ans += y*nres[i]
    ans%=MOD

print(ans)