/* -*- coding: utf-8 -*-
 *
 * 2075.cc:  No.2075 GCD Subsequence - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_A = 1000000;
const int INF = 1 << 30;
const int MOD = 998244353;

/* typedef */

typedef vector<int> vi;
typedef set<int> si;

template<const int MOD>
struct MI {
  int v;
  MI(): v() {}
  MI(int _v): v(_v % MOD) {}
  MI(long long _v): v(_v % MOD) {}

  MI operator+(const MI m) const { return MI(v + m.v); }
  MI operator-(const MI m) const { return MI(v + MOD - m.v); }
  MI operator*(const MI m) const { return MI((long long)v * m.v); }

  MI &operator+=(const MI m) { return (*this = *this + m); }
  MI &operator-=(const MI m) { return (*this = *this - m); }
  MI &operator*=(const MI m) { return (*this = *this * m); }

  MI pow(int n) const {  // a^n % MOD
    MI pm = 1, a = *this;
    while (n > 0) {
      if (n & 1) pm *= a;
      a *= a;
      n >>= 1;
    }
    return pm;
  }

  MI inv() const { return pow(MOD - 2); }
  MI operator/(const MI m) const { return *this * m.inv(); }
  MI &operator/=(const MI m) { return (*this = *this / m); }
};

typedef MI<MOD> mi;
typedef pair<int,mi> pimi;
typedef map<int,pimi> mipimi;

/* global variables */

int pdivs[MAX_A + 1], as[MAX_N];
mi dp[MAX_N];

/* subroutines */

int gen_primes(int maxp, vi &pnums) {
  pdivs[0] = 0, pdivs[1] = 1;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (! pdivs[p]) {
      pnums.push_back(p);
      pdivs[p] = p;
      for (int q = p * p; q <= maxp; q += p)
	if (! pdivs[q]) pdivs[q] = p;
    }
  for (; p <= maxp; p++)
    if (! pdivs[p]) pnums.push_back(p), pdivs[p] = p;
  return (int)pnums.size();
}

void prime_decomp(int n, vi &pds) {
  pds.clear();
  while (n > 1) {
    int p = pdivs[n];
    pds.push_back(p);
    while (n % p == 0) n /= p;
  }
}

/* main */

int main() {
  vi pnums;
  int pn = gen_primes(MAX_A, pnums);
  //printf("pn=%d\n", pn);

  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  mipimi las;
  mi sum = 0;

  for (int i = 0; i < n; i++) {
    vi pds;
    prime_decomp(as[i], pds);
    //printf("as[%d]=%d:", i, as[i]);
    //for (auto p: pds) printf(" %d", p); putchar('\n');

    dp[i] = 1;
    si prvs;
    for (auto p: pds) {
      mipimi::iterator mit = las.find(p);
      if (mit != las.end()) {
	int la = mit->second.first;
	if (prvs.find(la) == prvs.end()) {
	  dp[i] += mit->second.second;
	  prvs.insert(la);
	}
      }
    }

    for (auto p: pds) {
      mipimi::iterator mit = las.find(p);
      if (mit != las.end())
	mit->second = pimi(i, mit->second.second + dp[i]);
      else
	las[p] = pimi(i, dp[i]);
    }

    sum += dp[i];
  }

  printf("%d\n", sum.v);
  return 0;
}