/* -*- coding: utf-8 -*-
 *
 * 1378.cc:  No.1378 Flattening - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 5000;
const int INF = 1 << 30;
const int MOD = 998244353;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N], ls[MAX_N], rs[MAX_N];
int dp0[MAX_N + 1], dp1[MAX_N + 2];

/* subroutines */

inline void addmod(int &a, int b) { a = (a + b) % MOD; }

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  for (int i = 0; i < n; i++) {
    ls[i] = i, rs[i] = i + 1;
    while (ls[i] > 0 && as[ls[i] - 1] > as[i]) ls[i]--;
    while (rs[i] < n && as[rs[i]] > as[i]) rs[i]++;
    //printf("%d: %d-%d\n", i, ls[i], rs[i]);
  }

  dp0[0] = 1;

  for (int i = 0; i < n; i++) {
    memset(dp1, 0, sizeof(dp1));

    for (int j = ls[i]; j < rs[i]; j++)
      if (dp0[j]) {
	addmod(dp1[j + 1], dp0[j]);
	addmod(dp1[rs[i] + 1], MOD - dp0[j]);
      }
    for (int j = ls[i]; j <= rs[i]; j++)
      addmod(dp1[j + 1], dp1[j]);

    for (int j = 0; j <= n; j++) addmod(dp0[j], dp1[j]);
    //for (int j = 0; j <= n; j++) printf("%d ", dp0[j]); putchar('\n');
  }

  printf("%d\n", dp0[n]);
  return 0;
}