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

using i64 = long long;
const int N = 2e5 + 10, P = 998244353;

int n, p[N], tr[N];

i64 ans;

int qpow(int b, i64 k) {
    int ret = 1;
    while(k > 0) {
        if(k & 1) ret = (i64)ret * b % P;
        b = (i64)b * b % P;
        k >>= 1;
    }
    return ret;
}

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

    cin >> n;
    ans = n * (n - 1ll) / 2;
    for(int i = 1; i <= n; i ++) {
        cin >> p[i];
        if(p[i] < p[i - 1]) ans --;
    }
    
    cout << qpow(2, ans) << "\n";
}