#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define ll long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define fi first
#define pll pair<ll, ll>
#define se second
#define lll __int128
#define ld long double
#define all(a) a.begin() + 1, a.end()
#define iofast                   \
    ios::sync_with_stdio(false); \
    cin.tie(0), cout.tie(0)
#define lowbit(i) (i & (-i))
using namespace std;
const int maxn = 1e6 + 5, mod = 1000000007;
class bit
{
public:
    ll b[maxn];
    int n; // 记得初始化
    void add(int x, int add)
    {
        for (int i = x; i <= n; i += lowbit(i))
        {
            b[i] += add;
        }
    }
    ll s(int a)
    {
        ll ans = 0;
        for (int i = a; i > 0; i -= lowbit(i))
        {
            ans += b[i];
        }
        return ans;
    }
    ll query(int l, int r)
    {
        return s(r) - s(l - 1);
    }
} bit;
// modint
template <int MOD>
struct Fp
{
    ll val;
    Fp(ll v = 0) : val(v % MOD)
    {
        if (val < 0)
            val += MOD;
    }
    int getmod() const { return MOD; }
    Fp operator-() const { return val ? MOD - val : 0; }
    Fp operator+(const Fp &r) const { return Fp(*this) += r; }
    Fp operator-(const Fp &r) const { return Fp(*this) -= r; }
    Fp operator*(const Fp &r) const { return Fp(*this) *= r; }
    Fp operator/(const Fp &r) const { return Fp(*this) /= r; }
    Fp &operator+=(const Fp &r)
    {
        val += r.val;
        if (val >= MOD)
            val -= MOD;
        return *this;
    }
    Fp &operator-=(const Fp &r)
    {
        val -= r.val;
        if (val < 0)
            val += MOD;
        return *this;
    }
    Fp &operator*=(const Fp &r)
    {
        val = val * r.val % MOD;
        return *this;
    }
    Fp &operator/=(const Fp &r)
    {
        ll a = r.val, b = MOD, u = 1, v = 0;
        while (b)
        {
            ll t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0)
            val += MOD;
        return *this;
    }
    bool operator<(const Fp &r) const { return this->val < r.val; }
    bool operator==(const Fp &r) const { return this->val == r.val; }
    bool operator!=(const Fp &r) const { return this->val != r.val; }
    friend istream &operator>>(istream &is, Fp<MOD> &x)
    {
        is >> x.val;
        x.val %= MOD;
        if (x.val < 0)
            x.val += MOD;
        return is;
    }
    friend ostream &operator<<(ostream &os, const Fp<MOD> &x) { return os << x.val; }
    friend Fp<MOD> modpow(const Fp<MOD> &r, ll n)
    {
        if (n == 0)
            return 1;
        if (n < 0)
            return modpow(modinv(r), -n);
        Fp<MOD> t = modpow(r, n / 2);
        t = t * t;
        if (n & 1)
            t = t * r;
        return t;
    }
    friend Fp<MOD> modinv(const Fp<MOD> &r)
    {
        ll a = r.val, b = MOD, u = 1, v = 0;
        while (b)
        {
            ll t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        return Fp<MOD>(u);
    }
};
const int MOD = 998244353; // 看取得哪个模！！！！！！！！！！！
typedef Fp<MOD> mint;
mint qkpow(mint a, ll p = MOD - 2)
{
    mint t = 1, tt = a;
    while (p)
    {
        if (p & 1)
            t = t * tt;
        tt = tt * tt;
        p >>= 1;
    }
    return t;
}
void solve()
{
    int n;
    cin >> n;
    mint ans = 1;
    bit.n = n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    stack<int> stk;
    vector<int> in(n + 1);
    int mx = 0;
    a.push_back(inf);
    for (int i = 1; i <= n; i++)
    {
        if (mx > a[i] && !in[i])
        {
            ans *= qkpow(2);
        }
        mx = max(mx, a[i]);
        if (a[i] > a[i + 1])
        {
            ans *= qkpow(2, n - i - 1);
            in[i + 1]++;
        }
        else
            ans *= qkpow(2, n - i);
    }
    cout << ans << endl;
}
int main()
{
    iofast;
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    // cout << endl;
    //  system("pause");
}