#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2e5 + 10;
vector<int> e[maxn];
const int inf = 1e18;
int idx = 1;
int a[maxn];
const int mod = 998244353;
int ksm(int a, int b) {
    if (b < 0) return 1;
    int ans = 1;
    while (b) {
        if (b & 1) {
            ans = ans * a % mod;
        }
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    vector<int> v[2];
    int ans = 1;
    for (int i = 1; i <= n; i++) {
        if (i == 1 || a[i] < a[i - 1]) {
            v[0].push_back(a[i]);
            ans = ans * ksm(2, (i - 2)) % mod;
        } else {
            if (a[i] > v[0][0]) {
                ans = ans * ksm(2, (i - 1)) % mod;
            } else {
                reverse(v[0].begin(), v[0].end());
                int p = upper_bound(v[0].begin(), v[0].end(), a[i]) - v[0].begin();
                ans = ans * ((ksm(2, (p + 1)) % mod - 1 + mod) % mod) % mod;
                int les = v[0].size();
                les -= (p + 1);
                ans = ans * (ksm(2, les)) % mod;
                v[0].clear();
                v[0].push_back(a[i]);
            }
        }
    }
    cout << ans << '\n';
}