#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll,ll> P;
#define _for(x,y,z) for (int x(y),_(z); x<=_; ++x)
#define _rep(x,y,z) for (int x(y),_(z); x>=_; --x)
inline ll read(){ ll x; cin>>x; return x; }
inline void _init(){
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
}

const int N = 2e5 + 5;
const ll mod = 998244353;

ll n, a[N];

inline ll qpow(ll a, ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) {
			res = res * a % mod;
		}
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}

void init() {}
void procedure() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	ll t = n * (n - 1) >> 1;

	ll cnt = 0;
	for (int i = 2; i <= n; ++i) {
		cnt = max(cnt, a[i-1]);
		if (cnt > a[i]) {
			--t;
		}
	}
	cout << qpow(2, t) << "\n";
}

int main() {
	_init(), init();
	int T=1;
	while(T--) procedure();
	return 0;
}