class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

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

N, = map(int, input().split())

A = list(map(int, input().split()))
d = dict()
sA = sorted(list(set(A)))
la = len(sA)
for i, x in enumerate(sA):
    d[x]=i+1

bt = Bit(la)
bt2 = Bit(la)
X = [0]*N
for i, a in enumerate(A):
    X[i] = (bt.sum(la)-bt.sum(d[a]), bt2.sum(la)-bt2.sum(d[a]))
    bt.add(d[a], 1)
    bt2.add(d[a], a)
bt = Bit(la)
bt2 = Bit(la)
Y = [0]*N
for i in range(N-1, -1, -1):
    a = A[i]
    Y[i] = (bt.sum(d[a]-1), bt2.sum(d[a]-1))
    bt.add(d[a], 1)
    bt2.add(d[a], a)

MOD =  998244353
R = 0
for i in range(N):
    a, b = X[i]
    c, d = Y[i]
    R = (R + A[i]*a*c + b*c + d*a)%MOD
print(R)