#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 998244353


//edit
class Combination {

public:
    vector<ll> fact;

    Combination(int max_n) {
        //1 ~ n!までの階乗modを求める
        int n = max_n;
        vector<ll> fact(n + 1);
        fact[0] = 1;
        for (int i = 1; i <= n; i++) {
            fact[i] = (fact[i - 1] * i) % MOD;
        }
        this->fact = fact;
    }

    template<typename T>
    //templateをつかってみｔか
    ll pow(T x, int y) {
        if (y == 0) return 1;
        if (y == 1) return x;
        if (y == 2) return (x * x) % MOD;
//        if (y % 2 == 1) return pow(x, y / 2) * pow(x, y / 2) % MOD;
        if (y % 2 == 1) return pow(pow(x, y / 2), 2) * x % MOD;
//        return pow(x, y / 2) * pow(x, y / 2) % MOD;
        return pow(pow(x, y / 2), 2) % MOD;
    }

    ll nCk(int n, int k) {
//        return (fact[n] * pow(fact[n-k],MOD-2) * pow(fact[k],MOD-2)) % MOD;
        return (((fact[n] * pow(fact[n - k], MOD - 2)) % MOD) * pow(fact[k], MOD - 2)) % MOD;
    }

    /**
     * x ^ -1を求める
     */
    template<typename T>
    ll inv(T x) {
        return pow(x, MOD - 2);
    }
};

Combination cmb(10);

Int modadd(Int a, Int b) {
    return (a + b) % MOD;
}

Int modsub(Int a, Int b) {
    Int ret = (a - b) % MOD;
    if (ret < 0) ret += MOD;
    return ret;
}

Int modmul(Int a, Int b) {
    return a * b % MOD;
}

class Solve {
public:
    void solve() {
        Int N;
        cin >> N;
        vector<Int> A(N);
        Int maxA = 1000000;
        for (int i = 0; i < N; ++i) cin >> A[i];

        vector<Int> w(maxA + 1);
        vector<Int> C(maxA + 1);
        for (int i = 1; i <= maxA; ++i) w[i] = cmb.inv(i);
        for (int i = 1; i <= maxA; ++i) {
            for (int j = i * 2; j <= maxA; j += i) {
                w[j] = modsub(w[j], w[i]);
            }
        }

        for (auto e : A) {
            C[e]++;
        }

        Int ans = 0;
        Int div2 = cmb.inv(2);
        for (int i = 1; i <= maxA; ++i) {
            Int L = 0; // (s)^2
            Int R = 0; // s(^2)

            for (int j = i; j <= maxA; j += i) {
                L += C[j] * j % MOD;
                R += (C[j] * j * j) % MOD;
                L %= MOD;
                R %= MOD;
            }

            L = modmul(L, L);
            Int LR = modmul(modsub(L, R), div2);
            LR = modmul(LR, w[i]);
            ans = modadd(ans, LR);
        }
        cout << ans << endl;


    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 17408