#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include<atcoder/modint>
#endif
using namespace std;
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define RDVL(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);lin(__VA_ARGS__)
#define VL(n,...) RDVL(ll,n,__VA_ARGS__)
#define fo(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a)
#define defpp template<ostream&o=cout>void pp(const auto&...a){[[maybe_unused]]const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}void epp(const auto&...a){pp<cerr>(a...);}
#define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{
#define use_ml998244353 using ml=atcoder::modint998244353;
namespace my{
auto&operator<<(ostream&o,const atcoder::modint998244353&x){return o<<(int)x.val();}
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto refs(auto&...a){return array{ref(a)...};}
template<class T>constexpr auto for_range(T s,T a,T b,T c=1){return array{a-s,b,(1-s*2)*c};}
void lin(auto&...a){(cin>>...>>a);}
template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;
}
namespace my{
template<class T,class F=less<>>struct multiset:std::multiset<T,F>{
  multiset()=default;
  auto lemax(const T&x)const{auto p=this->upper_bound(x);return p!=this->begin()?prev(p):this->end();}
  auto gemin(const T&x)const{return this->lower_bound(x);}
};
template<class T,class F=less<>>struct set:multiset<T,F>{
  set()=default;
  template<class...A>auto emplace(A&&...a){
    T x(std::forward<A>(a)...);
    if(auto p=this->find(x);p!=this->end())return std::pair{p,0};
    return std::pair{multiset<T,F>::emplace(x),1};
  }
};
}
namespace my{
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>constexpr int depth=0;
template<class T>struct core_t_helper{using type=T;};
template<class T>using core_t=core_t_helper<T>::type;
template<class V>struct vec;
template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int D,class T>using hvec=hvec_helper<D,T>::type;
template<class V>struct vec:vector<V>{
  static constexpr int D=depth<V>+1;
  using C=core_t<V>;
  using vector<V>::vector;
  void resizes(const auto&...a){if constexpr(sizeof...(a)==D)*this=make(a...,C{});else{ }}
  static auto make(ll n,const auto&...a){
    if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]);
    else { }
  }
  vec&operator--(){fe(*this,e)--e;return*this;}
  ll size()const{return vector<V>::size();}
  auto iota()const{vec<int>r(size());std::iota(r.begin(),r.end(),0);return r;}
  auto&emplace_front(auto&&...a){this->emplace(this->begin(),std::forward<decltype(a)>(a)...);return*this;}
  template<class F=less<>>auto sort(F f={})const{vec v=*this;ranges::sort(v,f);return v;}
  template<class F=less<>>auto arg_sort_desc(F f={})const{return iota().sort([&](ll i,ll j){return(*this)[i]==(*this)[j]?i>j:f((*this)[i],(*this)[j]);});}
  auto next_less_enumerate()const{
    vec<int>res(size());
    set<int>s;
    s.emplace(size());
    fe(arg_sort_desc(),i){
      res[i]=*s.gemin(i);
      s.emplace(i);
    }
    return res;
  }
  auto pre_less_enumerate()const{
    vec<int>res(size());
    set<int>s;
    s.emplace(-1);
    fe(arg_sort_desc(),i){
      res[i]=*s.lemax(i);
      s.emplace(i);
    }
    return res;
  }
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
}
namespace my{entry
void main(){
  LL(N);
  VL(N,a);--a;
  a.emplace_front(-1);
  auto left_less=a.pre_less_enumerate();
  auto right_less=a.next_less_enumerate();

  use_ml998244353
  // dp[j]:(i番目までを使ってできる)長さjの数列の個数.in-place
  vec dp(N+1,ml{});
  dp[0]=1;
  fo(i,1,N+1){
    ll p=left_less[i];
    ll q=right_less[i];
    fo(j,p,q-1)dp[j+1]+=dp[j];
  }
  pp(dp[N]);
}}