#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
constexpr int inf=1e9+7;
constexpr ll longinf=1LL<<60 ;
constexpr ll mod=998244353 ;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int n;
	cin>>n;
	vector<int> a(n);
	rep(i,n)cin>>a[i];
	vector<int> l(n), r(n);
	rep(i,n){
		l[i]=i;
		while(l[i]>0 && a[l[i]-1]>a[i])--l[i];
		r[i]=i+1;
		while(r[i]<n && a[i]<a[r[i]])++r[i];
	}
	vector<ll> dp(n+1);
	dp[0]=1;
	rep(i,n){
		ll sum = 0;
		for(int j=l[i];j<=r[i];j++){
			ll tmp = dp[j];
			(dp[j] += sum) %= mod;
			(sum += tmp) %= mod;
		}
	}
	cout << dp[n] << endl;
	return 0;
}