mod = 998244353

class BIT:
	def query(self, m):
		res = 0
		while m > 0:
			res = (res + self.bit[m]) % mod
			m -= m&(-m)
		return res
	
	def sum(self, a, b):
		return (self.query(b)-self.query(a)) % mod
	
	def add(self, m, x):
		m += 1
		bitlen = len(self.bit)
		while m <= bitlen-1:
			self.bit[m] = (self.bit[m] + x) % mod
			m += m&(-m)
		return
		
	def __init__(self, a):
		self.bitlen = a
		self.bit = [0]*a

n = int(input())
a = list(map(int,input().split()))

def compress(arr):
	*XS, = set(arr)
	XS.sort()
	return {cmp_e: cmp_i for cmp_i, cmp_e in enumerate(XS)}

a_c = compress(a)
bitv = BIT(n+1)
bit1 = BIT(n+1)
bitw = BIT(n+1)
bit2 = BIT(n+1)

ans = 0
for i in range(n):
	targ = a_c[a[i]]
	ans = (ans+bit2.sum(targ+1,n)+a[i]*bitw.sum(targ+1,n))%mod
	bit2.add(targ,(bit1.sum(targ+1,n)+a[i]*bitv.sum(targ+1,n))%mod)
	bitw.add(targ,bitv.sum(targ+1,n))
	bit1.add(targ,a[i])
	bitv.add(targ,1)

print(ans)