#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define INF 1000000000
#define MOD 998244353
#define MAX 200000

int main(){
  int N;
  cin>>N;
  vector<pair<int,int>> P(N);
  for(int i=0;i<N;i++){
    cin>>P[i].first;
    P[i].second=i;
  }
  sort(P.begin(),P.end());
  int left=P[0].second;
  int right=P[0].second;
  ll ans=1;
  for(int i=1;i<N;i++){
    int k=P[i].second;
    if(left<=k&&k<=right){
      ans*=(ll)right-(ll)left+1-(ll)i;
      ans%=MOD;
    }else{
      left=min(left,k);
      right=max(right,k);
    }
  }
  cout<<ans<<'\n';
}