#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

mint op(mint a, mint b){
	return a + b;
}

mint e(){
	return 0;
}

int main(){
	int n; cin >> n;
	vector<int> a(n);
	rep(i,0,n) cin >> a[i];
	vector<pair<int,int>> b(n);
	rep(i,0,n) b[i] = pair(a[i], i);
	sort(b.begin(), b.end());
	vector<int> c(n);
	rep(i,0,n){
		c[b[i].second] = i;
	}
	vector<int> leftmin(n+1);
	int piv = 0;
	int nowmx = 998244;
	rrep(i,0,n+1){
		leftmin[i] = piv;
		if(i-1 >= 0 && chmin(nowmx, c[i-1])) piv++;
	}

	/*
	rep(i,0,n+1){
		cout << leftmin[i] << " ";
	}
	cout << endl;
	*/

	vector<int> lb(n+1, 1e9);
	rep(i,0,n+1){
		chmin(lb[leftmin[i]], i);
	}
	
	segtree<mint,op,e> seg(n+1);
	seg.set(0, 1);
	rep(i,1,n+1){
		seg.set(i, seg.prod(0, lb[leftmin[i]])); 
	}

	cout << seg.get(n).val() << '\n';

}