def coordinate_compression(arr):
    return {v: k for k, v in enumerate(sorted(set(arr)))}


n = int(input())


bit = [0] * (n + 4)


def add(a, i):
    while i <= n:
        bit[i] += a
        i += i & -i


def query(i):
    res = 0
    while i > 0:
        res += bit[i]
        i -= i & -i
    return res


a = list(map(int, input().split()))
c = coordinate_compression(a)
p = [0] * n
d = [1] * n
for i in range(n):
    x = a[i]
    p[i] += query(n - c[x])
    if d[i]:
        d[i] = 0
        add(x, n-c[x]+1)
bit = [0] * (n + 4)
q = [0] * n
d = [1] * n
for i in range(n - 1, -1, -1):
    x = a[i]
    q[i] += query(c[x]+1)
    if d[i]:
        d[i] = 0
        add(x, c[x] + 2)
ans = 0
bit = [0] * (n + 4)
pp = [0] * n
d = [1] * n
for i in range(n):
    x = a[i]
    pp[i] += query(n - c[x])
    add(1, n - c[x]+1)
bit = [0] * (n + 4)
qq = [0] * n
d = [1] * n
for i in range(n - 1, -1, -1):
    x = a[i]
    qq[i] += query(c[x]+1)
    add(1, c[x] + 2)
for i in range(n):
    ans += p[i] * qq[i] + q[i] * pp[i] + a[i] * pp[i] * qq[i]
print(ans % 998244353)