#include <bits/stdc++.h>


using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;


//#define int ll
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());


typedef pair<int, int> pii;
typedef pair<string, string> pst;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef pair<pld, pld> pldd;
typedef vector<pld> vpd;
typedef complex<double> base;


#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define my_abs(a) (((a) >= 0) ? (a) : -(a))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define MODIK(a) (a >= M ? a - M : a)
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif


const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

istream &operator >> (istream &in, pii &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pii &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


istream &operator >> (istream &in, pld &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pld &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) <<
               ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void print(vi kek, int k)
{
    ofstream cout("output.txt");
    cout << SZ(kek) << ' ' << k << '\n';
    for (auto p : kek) {
        cout << p << ' ';
    }
    cout.close();
    exit(0);
}


void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef ART_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef ART_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}


const int M1 = 1000000093, p1 = 27162;
const int M2 = 1000000087, p2 = 241;

const ld pi = atan2(1, 0) * 2, EPS = 1e-9;
const int pw = 10, N = 1e6 + 5, oo = 1e9 + 100, B = 316, M = 998244353;


int prime[N];
int cnt[N], prec[N];
ll sum[N], prec_sm[N];

vi dividers[N];


inline ll MOD(ll v)
{
    return v % M;
}


ll bin_pow(ll v, int pw)
{
    ll res = 1;
    while (pw)
    {
        if (pw & 1)
            res = MOD(res * v);

        v = MOD(v * v);
        pw >>= 1;
    }

    return res;
}


void get_dividers(int n)
{
    if (SZ(dividers[n]))
        return;


    int cur = n;
    int cnt = 0, last = prime[n];

    vpi kek;
    kek.reserve(10);

    while (cur != 1) {
        if (prime[cur] != last)
        {
            kek.push_back(mp(last, cnt));
            last = prime[cur];
            cnt = 0;
        }

        cur /= prime[cur];
        cnt++;
    }

    kek.push_back(mp(last, cnt));

    cnt = 1;
    for (auto p : kek)
        cnt *= (p.second + 1);

    dividers[n].reserve(cnt);
    dividers[n].push_back(1);

    for (auto p : kek) {
        int last = SZ(dividers[n]);
        int cur = 1;

        for (int j = 1; j <= p.second; ++j)
        {
            cur *= p.first;
            for (int i = 0; i < last; ++i)
                dividers[n].push_back(dividers[n][i] * cur);
        }
    }
}


void smain() {
    int n;
    cin >> n;

    for (int i = 2; i * i < N; ++i) {
        if (prime[i])
            continue;

        for (int j = i * i; j < N; j += i)
            if (!prime[j])
                prime[j] = i;
    }

    for (int i = 2; i < N; ++i)
        if (!prime[i])
            prime[i] = i;

    vi lel(n);
    for (int i = 0; i < n; ++i)
        cin >> lel[i];

    stable_sort(ALL(lel));

    map<int, int> flex;
    for (int v : lel)
        flex[v]++;

    vpi kek;
    for (auto p : flex)
        kek.push_back(p);

    for (int v : lel)
    {
        get_dividers(v);
        stable_sort(RALL(dividers[v]));
    }

    int ans = 0;

    for (auto p : kek)
    {
        ans = MOD(ans + (ll)p.second * (p.second - 1) / 2 * p.first);

        for (int v : dividers[p.first]) {
            ll count = cnt[v] - prec[v];
            ll sm = sum[v] - prec_sm[v];

            ans = MOD(ans + (MOD(p.first * sm) * bin_pow(v, M - 2)) * p.second);
            get_dividers(v);

            for (int u : dividers[v])
            {
                prec[u] = prec[u] + count;
                prec_sm[u] = prec_sm[u] + sm;
            }
        }

        for (int v : dividers[p.first])
            for (int u : dividers[v])
                prec[u] = prec_sm[u] = 0;

        for (int v : dividers[p.first]) {
            cnt[v] += p.second;
            sum[v] += (ll)p.first * p.second;
        }
    }

    cout << ans;
}


Measured memory_bytes: 93044