# https://atcoder.jp/contests/agc058/tasks/agc058_b
# で出題されたのでこちらでも通しておきます。

import sys
input = sys.stdin.readline

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

A=[n+1-a for a in A]

mod=998244353

IND=[-1]*(n+1)

for i in range(n):
    IND[A[i]]=i

LEFT=[[] for i in range(n)]
RIGHT=[[] for i in range(n)]

for i in range(1,n+1):
    x=IND[i]

    RIGHT[x].append(i)

    for j in range(x-1,-1,-1):
        if A[j]<i:
            RIGHT[j].append(i)
        else:
            break

    for j in range(x+1,n):
        if A[j]<i:
            LEFT[j].append(i)
        else:
            break
        
DP=[[0]*(n+1) for i in range(n)]

for x in RIGHT[0]:
    DP[0][x]=1


for i in range(1,n):
    DPR=[0]*(n+1)
    DPL=[0]*(n+1)
    
    for j in range(1,n+1):
        if DP[i-1][j]==0:
            continue
        plus=DP[i-1][j]

        # left
        if IND[j]<i:
            DPL[j]+=plus
            DPR[0]+=plus
        else:
            DPR[j]+=plus

    #print(DPL,DPR)

    for j in range(n-1,-1,-1):
        DPL[j]=(DPL[j]+DPL[j+1])%mod

    for j in range(1,n+1):
        DPR[j]=(DPR[j]+DPR[j-1])%mod

    #print(DPL,DPR)

    for right in RIGHT[i]:
        DP[i][right]=DPR[right]

    for left in LEFT[i]:
        DP[i][left]=DPL[left]

print(sum(DP[-1])%mod)