#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N;
  cin >> N;
  vector<int> P(N);
  for (int i = 0; i < N; i++){
    cin >> P[i];
  }
  vector<int> Q(N);
  for (int i = 0; i < N; i++){
    Q[P[i]] = i;
  }
  int L = Q[0], R = Q[0];
  int c = 0;
  long long ans = 1;
  for (int i = 1; i < N; i++){
    if (Q[i] < L){
      c += L - Q[i] - 1;
      L = Q[i];
    } else if (Q[i] > R){
      c += Q[i] - R - 1;
      R = Q[i];
    } else {
      ans *= c;
      ans %= MOD;
      c--;
    }
  }
  cout << ans << endl;
}