import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect
import string

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


class BIT:
    # 0-indexed
    def __init__(self, N):
        self.N = N
        self.X = [0] * (N + 1)

    def add(self, i, x):
        i += 1
        while i <= self.N:
            self.X[i] += x
            self.X[i] %= mod
            i += i & -i

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

    def range_sum(self, l, r):
        return self.sum(r) - self.sum(l)


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

brn = BIT(N)
brs = BIT(N)
bln = BIT(N)
bls = BIT(N)
R = [0] * N
Sr = [0] * N
L = [0] * N
Sl = [0] * N

B = [(i, A[i]) for i in range(N)]
B.sort(key=lambda x: x[1])
for i, a in B:
    brn.add(i, 1)
    brs.add(i, a)
    R[i] = brn.range_sum(i + 1, N)
    Sr[i] = brs.range_sum(i + 1, N)

B.sort(key=lambda x: x[0], reverse=True)
B.sort(key=lambda x: x[1], reverse=True)
for i, a in B:
    bln.add(i, 1)
    bls.add(i, a)
    L[i] = bln.range_sum(0, i)
    Sl[i] = bls.range_sum(0, i)

ans = 0
for i in range(N):
    ans += R[i] * Sl[i] + L[i] * Sr[i] + A[i] * R[i] * L[i]
    ans %= mod
print(ans)