#include <iostream>
#include <vector>
#include <set>

using namespace std;
typedef long long ll;
ll INF = 1000000000000000;
struct segment_tree{
    int n; vector<ll> seg;
    segment_tree(vector<ll> v){
        n = v.size(); seg.resize(2*n);
        for(int i=0;i<n;i++) seg[i + n] = v[i];
        for(int i=n - 1;i>0;i--) seg[i] = seg[i<<1] + seg[i<<1|1];
    }
    void update(int p,ll val){
        for(seg[p += n] = val;p>1;p>>=1) seg[p>>1] = (seg[p] + seg[p^1]);
    }
    ll query(int l,int r){
        ll res = 0;
        for(l += n,r += n; l<r;l>>=1,r>>=1){
            if(l&1) res += seg[l++];
            if(r&1) res += seg[--r];
        }
        return res;
    }
    void clear(){for(int i=0;i<2*n;i++) seg[i] = 0;}
};

ll mod = 998244353;
int p[200010],q[200010];
int main(){
    int i,n; cin >> n;
    for(i=0;i<n;i++){
        cin >> p[i]; q[p[i]] = i;
    }
    vector<ll> v(n);
    segment_tree seg(v);
    set<int> s;
    ll ans = 1;
    for(i=0;i<n;i++){
        int pos = q[i];
        int l = 1000000000,r = -1;
        if(s.size()){
            l = *s.begin(),r = *s.rbegin();
        }
        //cout << i << " " << l << " " << r << " " << seg.query(l,r) << endl;
        if(l<pos && pos<r) (ans *= (r - l - seg.query(l,r))) %= mod;
        s.insert(pos); seg.update(pos,1);
    }
    cout << ans << endl;
}