class Mobius():
    def __init__(self, N):
        self.L = list(range(N + 1))
        self.mobius = [1] * (N + 1)
        for i in range(2, N + 1):
            if i != self.L[i]:
                continue
            self.mobius[i] = -1
            for j in range(2 * i, N + 1, i):
                if self.L[j] == j:
                    self.L[j] = i
                if (j // i) % i == 0:
                    self.mobius[j] = 0
                else:
                    self.mobius[j] = - self.mobius[j]


N = int(input())
A = list(map(int, input().split()))
M = max(A) + 5
dp = [0] * M
g = [0] * M
S = [0] * M
for a in A:
    S[a] = 1
s = 0
mod = 998244353
d = [[] for i in range(M)]
for i in range(1, M):
    for j in range(i, M, i):
        if S[j]:
            d[j].append(i)

m = Mobius(M).mobius

for a in A:
    temp = 0
    for dd in d[a]:
        temp += m[dd] * g[dd]
    v = 1 + s - temp
    s += v
    dp[a] += v
    s %= mod
    dp[a] %= mod
    for dd in d[a]:
        g[dd] += v
        g[dd] %= mod
        
print(sum(dp) % mod)