class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

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

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get_size(self, x):
        x = self.find(x)
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x


N = int(input())
P = list(map(int, input().split()))
T1, T2 = Fenwick_Tree(N), Fenwick_Tree(N)
ans = 0
mod = 998244353
inv = pow(2, mod - 2, mod)
N2 = now = pow(2, N - 1, mod)
two = 1
for i in range(N):
    P[i] -= 1
    v1 = T1.sum(P[i], N)
    v2 = T2.sum(P[i], N)
    T1.add(P[i], N2)
    T2.add(P[i], two)
    ans += v1 - v2 * now
    now *= inv
    two *= 2
    ans %= mod
    now %= mod
    two %= mod
    
print(ans)