#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

int main(){
	
	int n;
	cin>>n;
	vector<int> a(n);
	rep(i,n)cin>>a[i];
	reverse(a.begin(),a.end());
	
	vector<mint> imos(n+1,0);
	vector<mint> dp(n+1);
	int m = Inf32;
	multiset<int> S;
	int cr = 0;
	S.insert(a[0]);
	rep(i,n){
		if(i!=0)imos[i] += imos[i-1];
		{
			auto it = S.lower_bound(a[i]);
			S.erase(it);
		}
		dp[i]++;
		dp[i] += imos[i];
		m = min(m,a[i]);
		//cout<<i<<endl;
		if(cr<=i){
			S.clear();
			cr = i;
		}
		//cout<<i<<endl;
		while(cr!=n){
			if(S.size()>0 && (*S.begin())<=a[i])break;
			cr++;
			if(cr==n)break;
			S.insert(a[cr]);
		}
		//cout<<i<<endl;
		if(S.size()>0 && (*S.begin())<=a[i]){
			imos[cr]+=dp[i];
		}
		
	}
	/*
	rep(i,n+1){
		cout<<dp[i].val()<<','<<imos[i].val()<<endl;
	}
	cout<<(imos.back()).val()<<endl;
	*/
	cout<<dp[n-1].val()<<endl;
	return 0;
}