#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
#include <fstream>
using namespace std;
long long in[200020];
long long mod = 998244353;
int main() {
	long long n;
	cin >> n;
	if (n == 1) {
		cout << 1 << endl;
		return 0;
	}
	for (int i = 0; i < n; i++) {
		int p;
		cin >> p;
		in[p] = i;
	}
	long long l = in[0], r = in[1];
	if (l > r) {
		swap(l, r);
	}
	long long ans = 1;
	long long now = r - l - 1;
	for (int i = 2; i < n; i++) {
		if (in[i] < l) {
			now += l - in[i] - 1;
			l = in[i];
		}
		else if (in[i] > r) {
			now += in[i] - r - 1;
			r = in[i];
		}
		else {
			ans *= now;
			now--;
			ans %= mod;
		}
	}
	cout << ans << endl;
}