#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N = 3e5 + 5;
const int mod = 998244353;
int n, a[N];
int kpow(int n, int k)
{
    int ret = 1;
    while (k)
    {
        if (k & 1ll)
            (ret *= n) %= mod;
        (n *= n) %= mod, k >>=1;
    }
    return ret;
}
void solve()
{
    cin >> n;
    int mx = 0, cnt = n * (n - 1) / 2;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (mx > a[i])
            cnt--;
        mx = max(mx, a[i]);
    }
    cout << kpow(2, cnt) << endl;
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    while (t--)
        solve();
    return 0;
}