import sys
input = sys.stdin.readline
from collections import *

def compress(l):
    l = list(set(l))
    l.sort()
    idx = defaultdict(int)

    for i in range(len(l)):
        idx[l[i]] = i
    
    return idx

class BIT:
    def __init__(self, n):
        self.n = n
        self.bit = [0]*(n+1)
    
    def add(self, i, x):
        i += 1
        
        while i<=self.n:
            self.bit[i] += x
            i += i&(-i)

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

N = int(input())
A = list(map(int, input().split()))
idx = compress(A)
n = len(idx.keys())
bit1 = BIT(n)
bit2 = BIT(n)
upper1 = [0]*N
upper2 = [0]*N

for i in range(N):
    upper1[i] = bit1.acc(n)-bit1.acc(idx[A[i]]+1)
    upper2[i] = bit2.acc(n)-bit2.acc(idx[A[i]]+1)
    bit1.add(idx[A[i]], 1)
    bit2.add(idx[A[i]], A[i])

bit1 = BIT(n)
bit2 = BIT(n)
lower1 = [0]*N
lower2 = [0]*N

for i in range(N-1, -1, -1):
    lower1[i] = bit1.acc(idx[A[i]])
    lower2[i] = bit2.acc(idx[A[i]])
    bit1.add(idx[A[i]], 1)
    bit2.add(idx[A[i]], A[i])

ans = 0
MOD = 998244353

for i in range(N):
    ans += A[i]*upper1[i]*lower1[i]+upper1[i]*lower2[i]+upper2[i]*lower1[i]
    ans %= MOD

print(ans)