#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
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;}

template< int mod >
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    assert(x);
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

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

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

template<class S, S (*op)(S, S), S (*e)()>
struct SegTree {
 public:
  SegTree() : SegTree(0) {}
  SegTree(int n) : SegTree(vector<S>(n, e())) {}
  SegTree(int n, S v) : SegTree(vector<S>(n, v)) {}
  SegTree(const vector<S>& v) : _n(int(v.size())){
    lg = 0;
    while ((1U << lg) < (unsigned int)(_n)) lg++;
    sz = 1 << lg;
    d = vector<S>(2 * sz, e());
    for (int i = 0; i < _n; ++i) d[sz + i] = v[i];
    for (int i = sz-1; i >= 1; --i) {
      update(i);
    }
  }

  void set(int p, S x) {
    assert(0 <= p && p < _n);
    p += sz;
    d[p] = x;
    for (int i = 1; i <= lg; ++i) update(p >> i);
  }

  S get(int p) {
    assert(0 <= p && p < _n);
    return d[p+sz];
  }

  S prod(int l, int r) {
    assert(0 <= l && l <= r && r <= _n);
    S sml = e(), smr = e();
    l += sz, r += sz;
    while(l < r) {
      if (l & 1) sml = op(sml, d[l++]);
      if (r & 1) smr = op(d[--r], smr);
      l >>= 1, r >>= 1;
    }
    return op(sml, smr);
  }

  S all_prod() { return d[1]; }

  using F = function<bool(S)>;

  // max_{r \in [l, n]} f(prod(l, r)) == true
  int max_right(int l, const F &f) {
    assert(0 <= l && l <= _n);
    assert(f(e()));
    if (l == _n) return _n;
    l += sz;
    S v = e();
    do {
      while(l % 2 == 0) l >>= 1;
      if (!f(op(v, d[l]))) {
        while(l < sz) {
          l *= 2;
          if (f(op(v, d[l]))) {
            v = op(v, d[l]);
            ++l;
          }
        }
        return l - sz;
      }
      v = op(v, d[l]);
      ++l;
    } while((l & -l) != l);
    return _n;
  }

  // min_{l \in [0, r]} f(prod(l, r)) == true
  int min_left(int r, const F &f) {
    assert(0 <= r && r <= _n);
    assert(f(e()));
    if (r == 0) return 0;
    r += sz;
    S v = e();
    do {
      --r;
      while(r > 0 && (r % 2)) r >>= 1;
      if (!f(op(d[r], v))) {
        while(r < sz) {
          r = r*2+1;
          if (f(op(d[r], v))) {
            v = op(d[r], v);
            --r;
          }
        }
        return r+1-sz;
      }
      v = op(d[r], v);
    } while((r & -r) != r);
    return 0;
  }

 private:
  int _n, sz, lg;
  vector<S> d;

  void update(int k) {d[k] = op(d[2*k], d[2*k+1]);}
};

static constexpr ll inf = 1000000000010000000;

ll op(ll a, ll b) {
  if (a >= dup(inf, b)) return inf;
  return a*b;
}
ll e() { return 1; }

using mint = ModInt<998244353>;

int main() {
  int n;
  cin >> n;
  vector<ll> a(n+1);
  rep(i,0,n+1) cin >> a[i];
  SegTree<ll,op,e> st(a);
  vector<int> r(n+1);
  rep(i,0,n+1) {
    if (a[i]%st.prod(i+1, n+1) == 0) {
      r[i] = n+1;
      continue;
    }
    int ok = i+1, ng = n+1;
    while(ng-ok > 1) {
      int mid = (ng+ok)/2;
      if (a[i]%st.prod(i+1, mid) == 0) {
        ok = mid;
      } else {
        ng = mid;
      }
    }
    r[i] = ok;
  }
  // rep(i,0,n+1) cout << r[i] << " ";
  // cout << endl;
  vector<mint> dp(n+2), ac(n+3);
  dp[0] = 1;
  rep(i,0,n+2) {
    if (i > 0) ac[i] += ac[i-1];
    dp[i] += ac[i];
    if (i < n+1) {
      ac[i+1] += dp[i];
      ac[r[i]+1] -= dp[i];
    }
    // rep(j,i+1,r[i]+1) dp[j] += dp[i];
  }
  cout << dp[n+1] << endl;
  return 0;
}