#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll dp[5050][5050];
const ll MOD=998244353;
int main()
{
    int n; cin>>n;
  int a[5050];
  for(int i=0; i<n; i++){
    cin>>a[i];
  }
  int l[5050],r[5050];
  for(int i=0; i<n; i++){
    int l1=i,r1=i;
    while(l1>0 && a[l1-1]>=a[i]) l1--;
    while(r1<n-1 && a[r1+1]>=a[i]) r1++;
    l[i]=l1,r[i]=r1;
  }
  for(int i=0; i<n; i++) if(l[i]==0) dp[0][i]=1;
  for(int i=0; i<n-1; i++){
    ll s=0;
    for(int j=0; j<n; j++){
      (s+=dp[i][j])%=MOD;
      if(!(l[j]<=i+1 && i+1<=r[j])) continue;
      (dp[i+1][j]+=s)%=MOD;
    }
  }
  ll ans=0;
  for(int i=0; i<n; i++){
    if(r[i]==n-1) (ans+=dp[n-1][i])%=MOD;
  }
  cout<<ans<<endl;
    return 0;
}