#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
P op(P a, P b) {
	if (a.first < b.first)return a;
	else if (a.first > b.first)return b;
	else if (a.second < b.second)return a;
	return b;
}
P e() { return { INF,INF }; }// min
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	map<int, vector<int>>mp;
	rep(i, n) mp[a[i]].push_back(i);
	vector<P>p(n);
	rep(i, n)p[i] = { a[i],i };
	segtree<P, op, e>seg(p);
	int idx = -1;
	mint ans = 1;
	while (idx + 1 < n) {
		auto get = seg.prod(idx + 1, n);
		auto v = mp[get.first];
		reverse(all(v));
		while (v.size() && v.back() <= idx) {
			v.pop_back();
		}
		if (-1 != idx)v.push_back(idx);
		reverse(all(v));
		rep(i, v.size() - 1) {
			ans *= v[i+1] - v[i] + 1;
		}
		idx = v.back();
	}
	cout << ans.val() << endl;
	return 0;
}