#include <bits/stdc++.h>
using namespace std;
constexpr int mod = 998244353;
int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	for (auto &e : a) cin >> e;
	vector<int> dp(n + 1);
	dp[0] = 1;
	for (int i = 0; i < n; i++) {
		int l = i, r = i + 1;
		while (l > 0 && a[l - 1] > a[i]) --l;
		while (r < n && a[i] < a[r]) ++r;
		for (int j = l; j < r; j++) (dp[j + 1] += dp[j]) %= mod;
	}
	cout << dp[n] << endl;
	return 0;
}