#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000000;
const long long MOD = 998244353;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<bool> prime(MAX + 1, true);
  vector<int> mobius(MAX + 1, 1);
  for (int i = 2; i <= MAX; i++){
    if (prime[i]){
      for (int j = 1; j * i <= MAX; j++){
        if (j > 1){
          prime[i * j] = false;
        }
        mobius[i * j] *= -1;
        if (j % i == 0){
          mobius[i * j] = 0;
        }
      }
    }
  }
  vector<vector<int>> F(MAX + 1);
  for (int i = 2; i <= MAX; i++){
    if (mobius[i] != 0){
      for (int j = i; j <= MAX; j += i){
        F[j].push_back(i);
      }
    }
  }
  vector<long long> dp(MAX + 1, 0);
  long long ans = 0;
  for (int i = 0; i < N; i++){
    long long sum = 1;
    for (int j : F[A[i]]){
      sum += dp[j] * (-mobius[j]) + MOD;
    }
    sum %= MOD;
    ans += sum;
    ans %= MOD;
    for (int j : F[A[i]]){
      dp[j] += sum;
      dp[j] %= MOD;
    }
  }
  cout << ans << endl;
}