//g++ 2.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;

#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

constexpr ll mod = 998244353;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;
  cin>>n;

  vector<pair<int,int>> P;
  rep(i,0,n){
    int p;
    cin>>p;
    P.emplace_back(p,i);
  }
  sort(all(P));

  ll ans=1;
  int left=P[0].se,right=P[0].se;
  rep(i,1,n){
    int ind=P[i].se;
    if(left<ind&&ind<right){
      ans*=(right-left+1-i);
      ans%=mod;
    }
    else{
      if(ind<left){
        left=ind;
      }
      else{
        right=ind;
      }
    }
  }

  cout<<ans<<endl;
}