import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

class BitSum:
    def __init__(self, n):
        self.n = n+1
        self.table = [0]*self.n

    def add(self, i, x):
        i += 1
        while i < self.n:
            self.table[i] += x
            self.table[i] %= md
            i += i & -i

    def sum(self, i):
        i += 1
        res = 0
        while i > 0:
            res += self.table[i]
            res %= md
            i -= i & -i
        return res

    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r-1)
        return (self.sum(r-1)-self.sum(l-1))%md

n = II()
aa = LI()

ll = [0]*n
rr = [0]*n

st = [(-1, -1)]
for i, a in enumerate(aa):
    while st[-1][-1] > a: st.pop()
    ll[i] = st[-1][0]+1
    st.append((i, a))
# pDB(ll)

st = [(n, -1)]
for i in range(n)[::-1]:
    a = aa[i]
    while st[-1][-1] > a: st.pop()
    rr[i] = st[-1][0]
    st.append((i, a))
# pDB(rr)

dp = BitSum(n+1)
dp.add(0,1)

for i, a in enumerate(aa):
    l, r = ll[i], rr[i]
    sj = r
    if r == n: sj = i+1
    for j in range(r, l, -1):
        s = dp.sumlr(l, j)
        dp.add(j, s)

print(dp.sumlr(n, n+1))