#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq

def input():
    return sys.stdin.readline()[:-1]

sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """10
# 3 1 4 1 5 9 2 6 5 3
# """
# sys.stdin = io.StringIO(_INPUT)

MOD = 998244353

class BIT:
    """
    Binary Indexed Tree (Fenwick Tree), 1-indexed
    """

    def __init__(self, n):
        """
        Parameters
        ----------
        n : int
            要素数。index は 0..n になる。
        """
        self.size = n
        self.data = [0] * (n+1)
        # self.depth = n.bit_length()

    def add(self, i, x):
        while i <= self.size:
            self.data[i] += x
            i += i & -i

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

    def get_rsum(self, l, r):
        """
        [l, r) の sum
        """
        return self.get_sum(r) - self.get_sum(l-1)

def main():
    N = int(input())
    A = list(map(int, input().split()))

    T = {a: i for i, a in enumerate(sorted(set(A)))}

    # 真ん中の A_j を固定

    # A_i > A_j となる A_i
    N1 = [0] * N
    L1 = [0] * N
    bit11 = BIT(N)
    bit12 = BIT(N)
    for i, a in reversed(list(enumerate(A))):
        N1[i] = bit11.get_sum(T[a]-1+1)
        L1[i] = bit12.get_sum(T[a]-1+1)
        bit11.add(T[a]+1, 1)
        bit12.add(T[a]+1, a)

    # A_j > A_k となる A_k
    N2 = [0] * N
    L2 = [0] * N
    bit21 = BIT(N)
    bit22 = BIT(N)
    for i, a in enumerate(A):
        N2[i] = bit21.get_rsum(T[a]+1+1, N)
        L2[i] = bit22.get_rsum(T[a]+1+1, N)
        bit21.add(T[a]+1, 1)
        bit22.add(T[a]+1, a)

    ans = 0
    for i in range(N):
        ans = (ans + N1[i] * L2[i] + N2[i] * L1[i] + (N1[i] * N2[i]) * A[i]) % MOD
    print(ans)

if __name__ == '__main__':
    main()