#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;

#if !ONLINE_JUDGE
#define debug
#endif

using namespace std;
 
/*******  All Required define Pre-Processors and typedef Constants *******/
#define mem(a, b) memset(a, (b), sizeof(a))
#define repd(i,k) for(int i=k;i>=0;i--)
#define rep(i,k) for(int i=0;i<k;i++)
#define repn(i,k1,k2) for(ll i=k1;i<k2;i++)
#define sz(x) (ll)(x).size()
#define ff first
#define ss second

#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 998244353
#define ee6 (ll)1000001
#define ee5 (ll)100001

#define trav(a, v) for(auto& a : v)

#define tt ll t;cin>>t; while(t--)
typedef long long int ll;
 
typedef pair<ll, ll> pr;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<pr> vpr;
typedef vector<vpr>vvpr;
typedef vector<vi> vvi;

//*X.find_by_order(2) element at index=2
//X.order_of_key(1) how many elements strictly less than 1

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
    tree_order_statistics_node_update>;

#ifdef debug
#define dbg(...) { cerr<<"[ "; dump(#__VA_ARGS__, __VA_ARGS__);}
#undef endl
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const pair<Arg1,Arg2> &x) {
    return out<<"("<<x.ff<<","<<x.ss<<")";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const vector<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const set<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const unordered_map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
} 
 
template <typename Arg1>
void dump(const string name, Arg1&& arg1){
    cerr << name << " : " << arg1 << " ] " << endl;
}
 
template <typename Arg1, typename... Args>
void dump(const string names, Arg1&& arg1, Args&&... args){
    const string name = names.substr(0,names.find(','));
    cerr<<name<<" : "<<arg1<<" | ";
    dump(names.substr(1+(int)name.size()), args...);
}
#else
    #define dbg(args...)
#endif
 
ll powmod(ll x, ll y) 
{ 
    ll res = 1;  
    x = x % MOD;
    while (y > 0) 
    { 
        if (y & 1) 
          res = (res*x) % MOD; 
        y = y>>1; // y = y/2 
        x = (x*x) % MOD;   
    } 
    return res; 
} 

const ll N=2*ee6;
ll phi[N],spf[N],mob[N];
vi primes;
bool iscomposite[N];

void pre()
{
  mob[1]=phi[1]=1;

  for(ll i=2;i<N;i++)
  {
    if(!iscomposite[i]){primes.pb(i);phi[i]=i-1;mob[i]=-1;spf[i]=i;}
    for(ll j=0;j<primes.size() and i*primes[j]<N;j++)
    {
      iscomposite[i*primes[j]]=true;
      spf[i*primes[j]]=primes[j];

      if(i%primes[j]==0){
        phi[i*primes[j]]=primes[j]*phi[i];
        mob[i*primes[j]]=0;
        break;
      }
      else
      {     
        phi[i*primes[j]]=phi[primes[j]]*phi[i];
        mob[i*primes[j]]=-mob[i];
      }
    }
  }
/*
  for(ll i=2;i<=30;i++)
    cout<<i<<" "<<phi[i]<<" "<<mob[i]<<" "<<spf[i]<<"\n";*/
}
ll w[ee6]; 
ll f[ee6];
ll inv[ee6];
vi g[ee6];
ll cnt[ee6],cnt2[ee6];
int main()
{
  #if !ONLINE_JUDGE
  //freopen("in.txt","r",stdin);
  #endif
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  pre(); 
  ll n;cin>>n;
  rep(i,n){
    ll x;cin>>x;
    f[x]++;   
  }

  inv[1]=1;
  for(ll i=2;i<=1000000;i++)
    inv[i]=inv[MOD%i]*(MOD-MOD/i)%MOD;

  for(ll i=1;i<=1000000;i++){
    for(ll j=i+i;j<=1000000;j+=i){
      g[j].eb(i);
    }
  }

  for(ll i=1;i<=1000000;i++){
    w[i]=inv[i];
    for(auto e:g[i]){
      w[i]=((w[i]-w[e])%MOD+MOD)%MOD;
    }
  }

  for(ll i=1;i<=1000000;i++){
    for(ll j=i;j<=1000000;j+=i){
      cnt[i]=(cnt[i]+j*f[j])%MOD;
      cnt2[i]=(cnt2[i]+j*j%MOD*f[j])%MOD;
    }
  }

  for(ll i=1;i<=1000000;i++){
    cnt[i]=((cnt[i]*cnt[i]%MOD-cnt2[i])%MOD+MOD)*inv[2]%MOD;
  }

  ll ANS=0;
  for(ll i=1;i<=1000000;i++)
    ANS=(ANS+w[i]*cnt[i])%MOD;

  cout<<ANS;
}

Measured memory_bytes: 269808