#include <bits/stdc++.h>
using namespace std;

#define maxn 200005
#define mod 998244353

int a[maxn];

int64_t qpow(int64_t a, int64_t x) {
    int64_t ans = 1;
    while (x) {
        if (x & 1) ans = ans * a % mod;
        a = a * a % mod, x >>= 1;
    }
    return ans;
}

void solve(void) {
    int n;
    cin >> n;
    int64_t ans = n * (n - 1) / 2;
    for (int i = 1, maxv = 0; i <= n; i++) {
        cin >> a[i];
        if (a[i] < maxv) ans--;
        maxv = max(maxv, a[i]);
    }
    cout << qpow(2, ans % (mod - 1)) << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int _ = 1;
    while (_--) solve();

    return 0;
}