#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = (n) - 1; i >= 0; i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

struct Eratosthenes{
    vector<bool> prime;
    vector<int> factor, mobius;
    Eratosthenes(int n) : prime(n + 1, true), factor(n + 1, -1), mobius(n + 1, 1){
        prime[1] = false;
        factor[1] = 1;
        for (int p = 2; p <= n; p++){
            if (!prime[p]){
                continue;
            }
            factor[p] = p;
            mobius[p] = -1;
            for (int q = 2 * p; q <= n; q += p){
                prime[q] = false;
                factor[q] = p;
                if ((q / p) % p == 0){
                    mobius[q] = 0;
                } else{
                    mobius[q] = -mobius[q];
                }
            }
        }
    }
    vector<pair<int, int>> factorize(int n){
        vector<pair<int, int>> pf;
        while (n > 1){
            int p = factor[n], exp = 0;
            while (n % p == 0){
                n /= p;
                exp++;
            }
            pf.push_back(make_pair(p, exp));
        }
        return pf;
    }
    vector<int> divisors(int n){
        vector<int> div = {1};
        vector<pair<int, int>> pf = factorize(n);
        for (auto [p, e] : pf){
            int l = div.size();
            for (int i = 0; i < l; i++){
                int q = p;
                for (int j = 0; j < e; j++){
                    div.push_back(div[i] * q);
                    q *= p;
                }
            }
        }
        //sort(div.begin(), div.end());
        return div;
    }
    int euler(int n){
        int e = n;
        vector<pair<int, int>> pf = factorize(n);
        for (int i = 0; i < pf.size(); i++){
            e /= pf[i].first;
            e *= pf[i].first - 1;
        }
        return e;
    }
};

const int MOD = 998244353;
int n, A[200010];
ll S[1000010];

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin >> n;
    ll s = 0;
    Eratosthenes er(1e6 + 1);
    rep(i, n){
        cin >> A[i];
        ll x = 1 + s;
        vector<int> div = er.divisors(A[i]);
        for (auto a : div){
            x -= er.mobius[a] * S[a];
            x %= MOD;
            if (x < 0){
                x += MOD;
            }
        }
        s += x;
        s %= MOD;
        for (auto a : div){
            S[a] += x;
            S[a] %= MOD;
        }
    }
    cout << s << "\n";
}