// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 2e5 + 10, MOD = 998244353;
inline int power(int x, ll y = MOD - 2) {
	int ans = 1;
	for (; y; x = (ll) x * x % MOD, y >>= 1)
		if (y & 1) ans = (ll) ans * x % MOD;
	return ans;
}
int n, a[N], t[N];
void add(int x) {
	for (; x <= n; x += x & -x) t[x]++;
}
int query(int x) {
	int s = 0;
	for (; x; x ^= x & -x) s += t[x];
	return s;
}
signed main() {
	read(n);
	F(i, 1, n) {
		read(a[i]);
	}
	ll s = 0;
	stack <int> t;
	DF(i, n, 1) {
		s += n - i;
		while (t.size() && t.top() < a[i]) {
			s--;
			t.pop();
		}
		t.push(a[i]);
		// if (query(a[i])) s += n - i - 1;
		// else s += n - i;
		// s += max(0, query(a[i]) - 1);
		// add(a[i]);
	}
	cout << power(2, s);
	return 0;
}
/* why?
*/