#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;
}
int lowbit(int x)
{
    return x & -x;
}
int tr[maxn];
void update(int x, int c)
{
    for (int i = x; i < maxn; i += lowbit(i))
    {
        tr[i] += c;
    }
}
int query(int x)
{
    int ans = 0;
    for (int i = x; i; i -= lowbit(i))
    {
        ans += tr[i];
    }
    return ans;
}
vector<int> v[maxn];
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];
    }
    int ans = 1;
    int j = 1;
    for (int i = 1; i <= n; i++)
    {
        if (i == 1 || a[i] < a[i - 1])
        {
            v[j].push_back(a[i]);
            ans = ans * ksm(2, (i - 2)) % mod;
        }
        else
        {
            v[++j].push_back(a[i]);
        }
    }
    vector<int> fir(j + 1);
    for (int i = 1; i <= j; i++)
    {
        fir[i] = v[i][0];
        reverse(v[i].begin(), v[i].end());
    }
    n = j;
    vector<int> sum(n + 1);
    vector<pair<int, int>> vec;
    for (int i = 1; i <= n; i++)
    {
        sum[i] = sum[i - 1] + v[i].size();
        vec.emplace_back(fir[i], i);
    }
    sort(vec.begin(), vec.end(), greater<pair<int, int>>());
    auto check = [&](int mid, int i) -> bool
    {
        return query(mid) == query(i);
    };
    for (auto &[fir, i] : vec)
    {
        if (query(i) == 0)
        {
            ans = ans * ksm(2, sum[i - 1]) % mod;
            update(i, 1);
            continue;
        }
        int l = 1, r = i;
        while (l < r)
        {
            int mid = l + r >> 1;
            if (check(mid, i))
            {
                r = mid;
            }
            else
                l = mid + 1;
        }
        int res = 1;
        int j = l;
        int p = upper_bound(v[j].begin(), v[j].end(), fir) - v[j].begin();
        res = res * ((ksm(2, (p + 1 + sum[i - 1] - sum[j])) % mod - 1 + mod) % mod) % mod;
        int les = v[j].size();
        les -= (p + 1);
        res = res * (ksm(2, sum[i - 1] - v[j].size() - sum[j] + les)) % mod;
        ans = ans * res % mod;
        update(i, 1);
    }
    cout << ans << '\n';
}