#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(p) p.begin(),p.end()
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
const int mod=998244353;

int main(){
	int N;
	cin>>N;
	vector<int> A(N),order(N),rev(N);
	rep(i,0,N) cin>>A[i],order[i]=i;
	sort(all(order),[&](int l,int r){
		if(A[l]==A[r]) return l<r;
		return A[l]<A[r];
	});
	vector<int> to(N);
	rep(i,0,N) rev[order[i]]=i;
	rev.push_back(N);
	int tmp=N;
	for(int i=N-1;i>=0;i--){
		if(rev[tmp]>rev[i]) tmp=i;
		to[i]=tmp+1;
	}
	vector<ll> dp(N+1);
	dp[0]=1;
	dp[1]=-1;
	rep(i,0,N) dp[i]%=mod,dp[to[i]]+=dp[i],dp[i+1]+=dp[i];
	cout<<dp[N]%mod<<"\n";
}