#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

constexpr lint MOD = 998244353;

vector<int> contained_prime(int N) // primes in [2, N]
{
    vector<int> ans(N + 1);
    iota(ans.begin(), ans.end(), 0);
    FOR(i, 2, N + 1) if (ans[i] == i)
    {
        for (int j = i; j <= N; j += i)
        {
            ans[j] = i;
        }
    }
    return ans;
}
vector<int> primeinfo;
vector<int> divisors(int n)
{
    map<int, int> factor;
    while (n > 1)
    {
        factor[primeinfo[n]]++;
        n /= primeinfo[n];
    }
    vector<int> now{1};
    for (auto pa : factor)
    {
        REP(i, now.size())
        {
            int d = 1;
            REP(_, pa.second)
            {
                d *= pa.first;
                now.push_back(now[i] * d);
            }
        }
    }
    return now;
}
constexpr int Amax = 1000000 + 10;

vector<lint> fac, facInv, inv;
void facInit(int nmax)
{
    fac = facInv = inv = vector<lint>(nmax + 1, 1);
    for (int i = 2; i <= nmax; i++)
    {
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        facInv[i] = facInv[i-1] * inv[i] % MOD;
    }
}
lint power(lint x, lint n, lint mod=MOD)
{
    lint ans = 1;
    while (n>0)
    {
        if (n & 1) (ans *= x) %= mod;
        (x *= x) %= mod;
       n >>= 1;
    }
   return ans;
}

int main()
{
    primeinfo = contained_prime(Amax);
    facInit(Amax);
    int N;
    cin >> N;
    vector<lint> A(N);
    cin >> A;

    vector<lint> tot1(Amax + 1), tot2(Amax + 1);
    for (auto a : A)
    {
        vector<int> divs = divisors(a);
        for (auto c : divs)
        {
            (tot1[c] += a) %= MOD;
            (tot2[c] += (lint)a * a) %= MOD;
        }
    }
    vector<lint> weight(Amax + 1);
    FOR(t, 1, Amax + 1)
    {
        lint adder = (MOD - weight[t] + inv[t]) % MOD;
        weight[t] = 0;
        for (lint s = t; s <= Amax; s += t)
        {
            (weight[s] += adder) %= MOD;
        }
    }
    lint ret = 0;
    FOR(t, 1, Amax + 1)
    {
        lint y = ((lint)tot1[t] * tot1[t] % MOD - tot2[t] + MOD) % MOD * inv[2] % MOD * (weight[t]) % MOD;
        ret += y;
    }
    cout << ret % MOD << endl;
}


Measured memory_bytes: 52608