//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize(3)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC target("sse3","sse2","sse")
//#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
//#pragma GCC target("f16c")
//#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
//#pragma GCC diagnostic error "-fwhole-program"
//#pragma GCC diagnostic error "-fcse-skip-blocks"
//#pragma GCC diagnostic error "-funsafe-loop-optimizations"
//#pragma GCC diagnostic error "-std=c++14"
#include "bits/stdc++.h"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/pb_ds/assoc_container.hpp"

#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x, l, u) for(ll x = l;x<u;x++)
#define RREP(x, l, u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x, a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define lowbit(x) ((x)&(-(x)))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define sz(x) ((int)x.size())
#define EX0 exit(0);

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace __gnu_pbds; //required
using namespace std;
template<typename T> using ordered_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef vector<ll> VLL;
typedef vector<int> VI;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 998244353;
const ll inf = 1e9 + 7;
const ld eps = 1e-9;
const db PI = atan(1) * 4;

template<typename T>
inline int sign(const T &a) {
    if(a < 0)return -1;
    if(a > 0)return 1;
    return 0;
}

string to_string(string s) { return '"' + s + '"'; }

string to_string(const char *s) { return to_string((string) s); }

string to_string(bool b) { return (b ? "true" : "false"); }

template<typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }

template<typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for(const auto &x : v) {
        if(!first) { res += ", "; }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}

#ifndef ONLINE_JUDGE
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) {}
#endif

template<typename T, typename S>
inline bool upmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; }

template<typename T, typename S>
inline bool upmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; }

template<typename T>
inline void in(T &x) {
    x = 0;
    T f = 1;
    char ch = getchar();
    while(!isdigit(ch)) {
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while(isdigit(ch)) {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    x *= f;
}

ll twop(int x) { return 1LL << x; }

template<typename T>
T MOD(T a, T m) {
    a %= m;
    if(a < 0)a += m;
    return a;
}

template<typename T>
T inverse(T a, T m) {
    a = MOD(a, m);
    if(a <= 1)return a;
    return MOD((1 - inverse(m, a) * m) / a, m);
}

template<typename A, typename B>
inline void in(A &x, B &y) {
    in(x);
    in(y);
}

template<typename A, typename B, typename C>
inline void in(A &x, B &y, C &z) {
    in(x);
    in(y);
    in(z);
}

template<typename A, typename B, typename C, typename D>
inline void in(A &x, B &y, C &z, D &d) {
    in(x);
    in(y);
    in(z);
    in(d);
}

template<typename T>
T sqr(T x) { return x * x; }

ll gcd(ll a, ll b) {
    while(b != 0) {
        a %= b;
        swap(a, b);
    }
    return abs(a);
}

ll fast(ll a, ll b, ll mod) {
    ll ans = 1;
    while(b) {
        if(b & 1) {
            b--;
            ans = ans * a % mod;
        } else {
            a = a * a % mod;
            b /= 2;
        }
    }
    return ans % mod;
}


namespace SOLVE {
    VLL v;
    ll n;
    void EulerSieve(const ll n, vector <ll> &primes, vector <ll> &phi, vector <ll> &mu) {
        phi = vector<ll>(n + 1);
        phi[1] = 1;
        mu = vector<ll>(n + 1);
        mu[1] = 1;
        vector <ll> isPrime(n + 1, 1);
        for (int i = 2; i <= n; i++) {
            if (isPrime[i]) {
                primes.PB(i);
                phi[i] = i - 1;
                mu[i] = -1;
            }
            for (const auto &j: primes) {
                ll num = 1LL * j * i;
                if (num > n)break;
                isPrime[num] = 0;
                if (i % j == 0) {
                    phi[num] = phi[i] * j;
                    mu[num] = 0;
                    break;
                } else {
                    phi[num] = phi[i] * (j - 1);
                    mu[num] = -mu[i];
                }
            }
        }
    }
    
    const ll maxn = 1000010;
    ll fac[maxn], facinv[maxn], inv[maxn];
    
    void init() {
        fac[0] = 1;
        REP(i, 1, maxn)
            fac[i] = i * (fac[i - 1]) % mod;
        facinv[maxn - 1] = inverse(fac[maxn - 1], mod);
        RREP(i, maxn - 2, 0)
        {
            facinv[i] = facinv[i + 1] * (i + 1) % mod;
        }
        inv[1] = 1;
        for (int i = 2; i < maxn; i++)
            inv[i] = (mod - (ll) mod / i * inv[mod % i] % mod);
    }
    
    ll combi(int n, int m) {
        if (n < 0 || m < 0 || n < m)return 0;
        return fac[n] * facinv[m] % mod * facinv[n - m] % mod;
    }
    
    
    ll f[maxn];
    ll s[maxn];
    ll w[maxn];
    
    VLL primes,phi,mu;
    void main() {
        EulerSieve(maxn,primes,phi,mu);
        init();
        in(n);
        v.resize(n);
        
        REP(i, 0, n)in(v[i]);
        REP(i, 0, n)f[v[i]]++;
        REP(i, 0, maxn)f[i] *= i;
        REP(i, 0, maxn)f[i] %= mod;
        for(int i = 1;i<maxn;i++){
            for(int j = i;j<maxn;j+=i)s[i]+=f[j];
            s[i] %= mod;
        }
        for(int i = 1;i<maxn;i++){
            for(int j = i;j<maxn;j+=i){
                w[j] += mu[j/i] * inv[i];
                w[j] %= mod;
            }
        }
        ll ans = 0;
        for(int i = 1;i<maxn;i++){
            ans += w[i] * s[i]%mod * s[i]%mod;
            
        }
        ans = MOD(ans,mod);
        REP(i,0,n)ans-=v[i];
        ans = MOD(ans,mod);
    
        ans *= inv[2];
        ans = MOD(ans,mod);
    
        cout<<ans<<endl;
    }
}


signed main() {
#ifndef ONLINE_JUDGE
#endif
    
    
    int t = 1;
//    in(t);
    for(int i = 1; i <= t; i++) {
//        cout<<"Case #"<<i<<":";
        SOLVE::main();
        
    }








//    clock_t st = clock();
//    while(clock() - st < 3.0 * CLOCKS_PER_SEC){
//
//    }
    
    
    
    
    
    
    return 0;
}


Measured memory_bytes: 64876