#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
//const int MOD = 1000000007;
const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template<int mod>
struct Mod_Int{
    int x;

    Mod_Int() : x(0) {}

    Mod_Int(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p){
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p){
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p){
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += Mod_Int(1);}

    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= Mod_Int(1);}

    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }

    Mod_Int pow(ll k) const{
        Mod_Int now = *this, ret = 1;
        for(; k; k >>= 1, now *= now){
            if(k&1) ret *= now;
        }
        return ret;
    }

    friend ostream &operator << (ostream &os, const Mod_Int &p){
        return os << p.x;
    }

    friend istream &operator >> (istream &is, Mod_Int &p){
        ll a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

template<typename T>
struct Sparse_Table{
    using F = function<T(T, T)>;
    const int n;
    vector<vector<T>> st;
    vector<int> lookup;
    const F f;
    const T e;

    Sparse_Table(const vector<T> &table, const F &f, const T &e) : n(sz(table)), f(f), e(e){
        int log_n = 32-__builtin_popcount(n);
        st.assign(log_n, vector<T>(n));
        rep(i, n) st[0][i] = table[i];
        rep(j, log_n-1){
            rep(i, n){
                if(i+(1<<j) < n) st[j+1][i] = f(st[j][i], st[j][i+(1<<j)]);
                else st[j+1][i] = st[j][i];
            }
        }
        lookup.assign(n+1, -1);
        rep2(i, 1, n) lookup[i] = lookup[i/2]+1;
    }

    T query(int l, int r) const{
        if(l >= r) return e;
        int k = lookup[r-l];
        return f(st[k][l], st[k][r-(1<<k)]);
    }

    T operator [] (int i) const {return st[0][i];}
};

int main(){
    int N; cin >> N;

    vector<int> a(N);
    rep(i, N) {cin >> a[i]; a[i]--;}
    vector<int> id(N);
    rep(i, N) id[a[i]] = i;

    auto f = [](int a, int b) {return min(a, b);};
    Sparse_Table<int> st(a, f, inf);

    vector<vector<mint>> dp(N+1, vector<mint>(N, 0));
    dp[0][0] = 1;

    rep(i, N){
        rep(j, N){
            if(j < N-1) dp[i][j+1] += dp[i][j];
            int L = i, R = id[a[j]];
            if(L > R) swap(L, R);
            if(st.query(L, R+1) == a[j]) dp[i+1][j] += dp[i][j];
        }
    }

    cout << accumulate(all(dp[N]), mint(0)) << '\n';
}