#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> p(n);
    for(int i = 0; i < n; i ++ ) {
        std::cin >> p[i];
    }

    std::vector<int> stk;
    std::vector<int> have(n);
    for(int i = 0; i < n; i ++ ) {
        while(stk.size() and p[i] > p[stk.back()]) stk.pop_back();
        if(stk.size()) have[i] = true;
        stk.push_back(i);
    }
    
    constexpr int P = 998244353;
    std::vector<int> pw2(n + 1);
    pw2[0] = 1;
    for(int i = 1; i <= n; i ++ ) {
        pw2[i] = pw2[i - 1] * 2 % P;
    }

    i64 ans = 1;
    for(int i = 0; i < n; i ++ ) {
        ans = ans * pw2[i - have[i]] % P;
    }
    std::cout << ans << '\n';
}

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

    
    int T = 1;
    // std::cin >> T;

    while(T -- ) {
        solve();
    }

    return 0;
}