class Compression:
    def __init__(self, iterable):
        self.vs = sorted(set(iterable))
        self.v2i = {}
        for i, val in enumerate(self.vs):
            self.v2i[val] = i

    def __len__(self):
        return len(self.vs)

    def index(self, val):
        """val のインデックスを返す"""
        return self.v2i[val]

    def value(self, index):
        """インデックスに対応する値を返す"""
        return self.vs[index]

    def map(self, iterable):
        return [self.index(x) for x in iterable]


class FenwickTree:
    def __init__(self, n: int):
        self.data = [0] * (n+10)
        self.n = n+10

    def add(self, p: int, x: int):
        assert 0 <= p < self.n
        p += 1
        while p < len(self.data):
            self.data[p] += x
            p += p & -p

    def sum(self, p: int) -> int:
        """区間 [0, p] の和"""
        assert 0 <= p < self.n
        p += 1
        s = 0
        while p > 0:
            s += self.data[p]
            p -= p & -p
        return s

    def range_sum(self, l: int, r: int) -> int:
        """区間 [l, r] の和"""
        assert 0 <= l <= r < self.n
        s = self.sum(r)
        if l > 0:
            s -= self.sum(l-1)
        return s


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

comp = Compression(A + [-1])
sz = len(comp) + 10
lsum = FenwickTree(sz)
rsum = FenwickTree(sz)
lcnt = FenwickTree(sz)
rcnt = FenwickTree(sz)
for a in A:
    p = comp.index(a)
    rsum.add(p, a)
    rcnt.add(p, 1)

ans = 0
for a in A:
    p = comp.index(a)
    ls = lsum.range_sum(p+1, sz)
    lc = lcnt.range_sum(p+1, sz)
    rs = rsum.range_sum(0, p-1)
    rc = rcnt.range_sum(0, p-1)

    if lc > 0 and rc > 0:
        ans += (ls * rc) + (rs * lc) + a * (lc * rc)
        ans %= MOD

    lsum.add(p, a)
    lcnt.add(p, 1)
    rsum.add(p, -a)
    rcnt.add(p, -1)

print(ans)