// 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;
}
long long f[1000001],an=1;
signed main() {
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	read(n);
	F(i, 1, n) {
		read(a[i]);
	}
//	f[0]=1;
//	for(int i=1;i<=500000;i++)
//	{
//		f[i]=(f[i-1]*(power(2,i-1)-1)%MOD*2+f[i-1])%MOD;
//	}
//	for(long long i=1;i<=500000;i++) f[i]=f[i]*power(power(2),i*(i+1)/2)%MOD;
	ll s = 0;
	stack <int> t;
	DF(i, n, 1) {
		s += n - i;
		long long gg=0;
		long long nww=1;
		while (t.size() && a[t.top()] < a[i]) {
			int tt=t.top();
			nww=nww*((power(2,(tt-i-1))-1)%MOD*2+1)%MOD*power(power(2),tt-i)%MOD;
			t.pop();
		}
//		cout<<f[gg]<<" ";
		an=an*nww%MOD;
		t.push(i);
		// if (query(a[i])) s += n - i - 1;
		// else s += n - i;
		// s += max(0, query(a[i]) - 1);
		// add(a[i]);
	}
	an=(an*power(2, s)%MOD+MOD)%MOD;
//	while(t.size()) cout<<t.top()<<" ",t.pop();
	cout << an;
	return 0;
}
/* why?
*/