#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//*
using mint=modint998244353;
const ll mod=998244353;
const ld EPS=1e-8;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
//*/
ll op(ll a,ll b){return min(a,b);}
ll e(){return 1e18;}
pair<mint,ll>op1(pair<mint,ll>a,pair<mint,ll>b){return make_pair(a.F+b.F,a.S+b.S);}
pair<mint,ll>e1(){return make_pair(0,0);}
pair<mint,ll>ma(mint f,pair<mint,ll>x){return make_pair(x.F+x.S*f,x.S);}
mint co(mint f,mint g){return f+g;}
mint id(){return 0;}
int main(){
  ll N;cin>>N;
  vi A(N);cin>>A;
  reverse(ALL(A));
  segtree<ll,op,e>S(A);
  lazy_segtree<pair<mint,ll>,op1,e1,mint,ma,co,id>L(N);
  REP(i,N)L.set(i,make_pair(1,1));
  REP(i,N-1){
  	ll mi=S.prod(0,i+1);
  	if(mi<S.prod(i+1,N))break;
  	ll l=i+1,r=N;
  	while(r-l>1){
  		ll m=(l+r)/2;
  		if(S.prod(i+1,m)<=mi)r=m;
  		else l=m;
  	}
  	//cout<<l<<endl;
  	L.apply(l,N,L.get(i).F);
  }
  //REP(i,N)cout<<L.get(i).F.val()<<" ";cout<<endl;
  cout<<L.get(N-1).F.val()<<endl;
  return 0;
}