#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int main(){
    int N; cin >> N;
    vector<int> A(N); rep(i,N) cin >> A[i];
    vector<int> B;
    rep(i,N){
        while(!B.empty() && A[B.back()] > A[i]) B.pop_back();
        B.push_back(i);
    }
    Modint ans = 1;
    rep(i,B.size()-1) ans *= (B[i+1] - B[i] + 1);
    cout << ans.val() << endl;
    return 0;
}

struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;