class BIT():
    def __init__(self,n):
        self.BIT=[0]*(n+1)
        self.num=n

    def query(self,idx):
        res_sum = 0
        while idx > 0:
            res_sum += self.BIT[idx]
            res_sum %= 998244353
            idx -= idx&(-idx)
        return res_sum

    #Ai += x O(logN)
    def update(self,idx,x):
        while idx <= self.num:
            self.BIT[idx] += x
            self.BIT[idx] %= 998244353
            idx += idx&(-idx)
        return

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

S = set([a for a in A])
S = list(S)
S.sort()
comp = {i:e+1 for e,i in enumerate(S)}

left = [0 for i in range(N)]
left_sum = [0 for i in range(N)]
bit = BIT(N)
bit_sum = BIT(N)
tmp = 0
mod = 998244353
for i in range(N):
    left[i] = i - bit.query(comp[A[i]])
    left_sum[i] = tmp - bit_sum.query(comp[A[i]])

    bit.update(comp[A[i]],1)
    bit_sum.update(comp[A[i]],A[i])
    tmp = (tmp + A[i]) % mod

right = [0]*N
right_sum = [0]*N
bit = BIT(N)
bit_sum = BIT(N)

for i in range(N-1,-1,-1):
    right[i] = bit.query(comp[A[i]]-1)
    right_sum[i] = bit_sum.query(comp[A[i]]-1)

    bit.update(comp[A[i]],1)
    bit_sum.update(comp[A[i]],A[i])

res = 0
for i in range(N):
    res += A[i] * left[i] * right[i]
    res %= mod
    res += left_sum[i] * right[i]
    res %= mod
    res += right_sum[i] * left[i]
    res %= mod

print(res)