class BIT:
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
 
    def build(self, list):
        self.tree[1:] = list.copy()
        for i in range(self.size+1):
            j = i + (i & (-i))
            if j < self.size+1:
                self.tree[j] += self.tree[i]

    def sum(self, i):
        # [0, i) の要素の総和を返す
        s = 0
        while i>0:
            s += self.tree[i]
            i -= i & -i
        return s
    # 0 index を 1 index に変更  転倒数を求めるなら1を足していく
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

    # 総和がx以上になる位置のindex をbinary search
    def bsearch(self,x):
        le = 0
        ri = 1<<(self.size.bit_length()-1)
        while ri > 0:
            if le+ri <= self.size and self.tree[le+ri]<x:
                x -= self.tree[le+ri]
                le += ri
            ri >>= 1
        return le+1


n = int(input())
mod = 998244353
a = list(map(int,input().split()))
dic = {}
s = sorted(list(set(a)))
for num,i in enumerate(s):
    dic[i] = num

le = len(s)
bitl = BIT(le+1)
L = [0]*n
for num,i in enumerate(a):
    c = bitl.sum(dic[i]+1)
    L[num] = num-c
    bitl.add(dic[i],1)
bitr = BIT(le+1)
R = [0]*n
for i in range(n-1,-1,-1):
    c = bitr.sum(dic[a[i]])
    R[i] = c
    bitr.add(dic[a[i]],1)
ans = 0
for i in range(n):
    ans += L[i]*R[i]*a[i]%mod
    ans %= mod
bitl = BIT(le+1)
s = 0
for num,i in enumerate(a):
    c = bitl.sum(dic[i]+1)
    ans += (s-c)*i%mod
    ans %= mod
    s += L[num]
    bitl.add(dic[i],L[num])
bitr = BIT(le+1)
for i in range(n-1,-1,-1):
    c = bitr.sum(dic[a[i]])
    ans += c*a[i]%mod
    ans %= mod
    bitr.add(dic[a[i]],R[i])
print(ans)