#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
const int MX = 1000005;
const int MOD = 998244353;
int n, pr[MX/5], p, a, b, c, e;
ll coe[MX], ac[MX], d[245], x, y, ans;
bool isnp[MX] = {1,1};
void exgcd(ll a, ll b, ll &x, ll &y){
	if(b){
		exgcd(b, a%b, y, x);
		y -= a/b*x;
	}else{
		x = 1; y = 0;
	}
}
int main(){
	for(int i = 1; i < MX; i++){
		exgcd(i,MOD,x,y);
		(coe[i] += x) %= MOD;
		if(!isnp[i]) pr[p++] = i;
		for(int j = i*2; j < MX; j += i){
			(coe[j] += MOD - coe[i]) %= MOD;
			if(!isnp[i]) isnp[j] = true;
		}
	}
	scanf("%d", &n);
	rep(i,n){
		scanf("%d", &a);
		d[0] = a; c = 1;
		for(int j=0; (ll)pr[j]*pr[j]<=a; j++) for(b=0; !(a%pr[j]); a/=pr[j])
			for(e = c; b < e; d[c++] = d[b++] / pr[j]);
		if(a != 1) for(b = 0,e = c; b < e; d[c++] = d[b++] / a);
		for(int j=0; j<c; j++){
			(ans += ac[d[j]] * coe[d[j]] % MOD * d[0] % MOD) %= MOD;
			(ac[d[j]] += d[0]) %= MOD;
		}
	}
	printf("%lld\n", ans);
}