// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
#define OUT(dist) std::cout<<(dist);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t:" << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define SHOWSTACK(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.top() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

#define random_shuffle "USE std::shuffle!";

// type/const
//#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 998244353;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

const int M = 5000000;
int P[348515]; // M以下の素数の個数. M+1にしてもいい気もする
int invP[M + 1];
int minP[M + 1];
bool isP[M + 1];

struct Eratosthenes {
	Eratosthenes() {
		int p = 0;
		REP(i, M + 1) isP[i] = true, minP[i] = -1;
		isP[0] = isP[1] = false;
		minP[0] = 0; minP[1] = 1;
		FOR(i, 2, M + 1) {
			if (isP[i]) {
				minP[i] = i;
				P[p] = i;
				invP[i] = p++;
				for (int j = i * 2LL; j <= M; j += i) {
					isP[j] = false;
					if (minP[j] == -1) minP[j] = i;
				}
			}
		}
	}
} _eratosthenes_init;

V<int> divs[1000006];
std::vector<int>& enumerateDivisors(ll n) {
	if (!divs[n].empty()) return divs[n];
	V<int> res;

	std::unordered_map<int, int> map;
	int t = n;
	while (t > 1) {
		++map[minP[t]];
		t /= minP[t];
	}
	V<PAIR> ps(map.size());
	int sz = 0;
	for (auto& p : map) ps[sz++] = p;
	map.clear();

	V<int> cnt(sz, 0);
	int now = 1;

	while (true) {
		res.emplace_back(now);
		int p = sz - 1;
		while (p >= 0) {
			if (cnt[p] < ps[p].second) {
				now *= ps[p].first;
				++cnt[p];
				break;
			}
			else {
				REP(_, ps[p].second) now /= ps[p].first;
				cnt[p] = 0;
				--p;
			}
		}
		if (p < 0) break;
	}
	std::sort(ALL(res));
	return divs[n] = res;
}

ll powMod(ll n, ll p) {
	ll res = 1;
	while (p) {
		if (p & 1) (res *= n) %= MOD;
		(n *= n) %= MOD;
		p >>= 1;
	}
	return res;
}
int inv[1000006];
ll invMod(ll n) {
	return inv[n] = powMod(n, MOD - 2);
}

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

int slow(int n, V<int> a) {
	int ans = 0;
	REP(i, n) FOR(j, i + 1, n) (ans += lcm(a[i], a[j])) %= MOD;
	return ans;
}

ll map[1000006];
ll sum[1000006];

signed main() {
	INIT;

	VAR(int, n);
	VEC(int, a, n);

	//auto system_now = std::chrono::system_clock::now();
	//std::mt19937 mt(std::chrono::duration_cast<std::chrono::microseconds>(system_now.time_since_epoch()).count());
	//std::uniform_int_distribution<> rand(/* min */1, /* max */1000000);
	//int n = 2000000; V<int> a(n); REP(i, n) a[i] = rand(mt);

	FOR(i, 1, 1000006) invMod(i);

	REP(i, n) {
		auto e(enumerateDivisors(a[i]));
		RREP(j, e.size()) map[e[j]] += a[i];
	}

	ll ans = 0;
	REP(i, n) {
		ll x = -1;
		RREP(j, divs[a[i]].size()) {
			int t = divs[a[i]][j];
			ll coef = map[t];
			int r = a[i] / t;
			const auto& e(enumerateDivisors(r));
			for (const auto& y : e) {
				if (y == 1) continue;
				coef -= sum[t * y];
			}
			sum[t] = coef;
			(x += coef % MOD * inv[t]) %= MOD;
		}
		(ans += a[i] * x) %= MOD;
		REP(j, divs[a[i]].size()) sum[divs[a[i]][j]] = 0;
	}
	(ans *= inv[2]) %= MOD;
	if (ans < 0) ans += MOD;
	OUT(ans)BR;

	return 0;
}

Measured memory_bytes: 121344