#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N;
  cin >> N;
  vector<int> a(N);
  for (int i = 0; i < N; i++){
    cin >> a[i];
  }
  vector<vector<long long>> dp(N + 1, vector<long long>(N + 1, 0));
  dp[0][0] = 1;
  for (int i = 0; i < N; i++){
    int L = 0;
    for (int j = i - 1; j >= 0; j--){
      if (a[j] < a[i]){
        L = j + 1;
        break;
      }
    }
    int R = N;
    for (int j = i + 1; j < N; j++){
      if (a[j] < a[i]){
        R = j;
        break;
      }
    }
    dp[i + 1] = dp[i];
    long long sum = 0;
    for (int j = L; j <= R; j++){
      dp[i + 1][j] += sum;
      dp[i + 1][j] %= MOD;
      sum += dp[i][j];
    }
  }
  cout << dp[N][N] << endl;
}