mod = 998244353
def BIT_query(BIT,idx):
    res_sum = 0
    while idx > 0:
        res_sum += BIT[idx]
        idx -= idx&(-idx)
    return res_sum % mod

def BIT_update(BIT,idx,x):
    while idx <= N:
        BIT[idx] += x
        BIT[idx] %= mod
        idx += idx&(-idx)
    return

def compress(li):
    *XS, = set(li)
    XS.sort()
    return {e: i for i, e in enumerate(XS)}

N = int(input())
A = list(map(int,input().split()))[::-1]
cA = compress(A)
ans = 0
BIT1 = [0]*(N+1)
BIT2 = [0]*(N+1)
BIT3 = [0]*(N+1)
BIT4 = [0]*(N+1)
for i in range(N):
    c = cA[A[i]]+1
    if c > 1:
        ans += BIT_query(BIT4,c-1)
        ans += BIT_query(BIT3,c-1)*A[i]
        ans %= mod
    BIT_update(BIT1,c,1)
    BIT_update(BIT2,c,A[i])
    num = 0
    SUM = 0
    if c > 1:
        num = BIT_query(BIT1,c-1)
        SUM = BIT_query(BIT2,c-1)
    BIT_update(BIT3,c,num)
    BIT_update(BIT4,c,A[i]*num)
    BIT_update(BIT4,c,SUM)
print(ans)