#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
#define MOD 998244353

template<int mod>
struct ModInt{
    int x;
    ModInt():x(0){}
    ModInt(long long y):x(y>=0?y%mod:(mod-(-y)%mod)%mod){}
    ModInt &operator+=(const ModInt &p){
        if((x+=p.x)>=mod)x-=mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p){
        if((x+=mod-p.x)>=mod)x-=mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p){
        x=(int)(1LL*x*p.x%mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p){
        *this*=p.inverse();
        return *this;
    }
	ModInt &operator^=(long long p){
		ModInt res = 1;
		for (; p; p >>= 1) {
			if (p & 1) res *= *this;
			*this *= *this;
		}
		return *this = res;
	}
    ModInt operator-()const{return ModInt(-x);}
    ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
    ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
    ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
    ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
	ModInt operator^(long long p)const{return ModInt(*this)^=p;}
    bool operator==(const ModInt &p)const{return x==p.x;}
    bool operator!=(const ModInt &p)const{return x!=p.x;}
    explicit operator int() const { return x; }                           // added by QCFium
    ModInt operator=(const int p) {x = p; return ModInt(*this);} // added by QCFium
    ModInt inverse()const{
        int a=x,b=mod,u=1,v=0,t;
        while(b>0){
            t=a/b;
            a-=t*b;
            std::swap(a,b);
            u-=t*v;
            std::swap(u,v);
        }
        return ModInt(u);
    }
    friend std::ostream &operator<<(std::ostream &os,const ModInt<mod> &p){
        return os<<p.x;
    }
    friend std::istream &operator>>(std::istream &is,ModInt<mod> &a){
        long long x;
        is>>x;
        a=ModInt<mod>(x);
        return (is);
    }
};
typedef ModInt<MOD> mint;

struct MComb {
    std::vector<mint> fact;
    std::vector<mint> inversed;
    MComb(int n) { // O(n+log(mod))
        fact = std::vector<mint>(n+1,1);
        for (int i = 1; i <= n; i++) fact[i] = fact[i-1]*mint(i);
        inversed = std::vector<mint>(n+1);
        inversed[n] = fact[n] ^ (MOD-2);
        for (int i = n - 1; i >= 0; i--) inversed[i]=inversed[i+1]*mint(i+1);
    }
    mint ncr(int n, int r) {
        return (fact[n] * inversed[r] * inversed[n-r]);
    }
    mint npr(int n, int r) {
        return (fact[n] * inversed[n-r]);
    }
    mint nhr(int n, int r) {
        assert(n+r-1 < (int)fact.size());
        return ncr(n+r-1, r);
    }
};

#define int64_t __int128
std::ostream&
operator<<( std::ostream& dest, __int128_t value )
{
    std::ostream::sentry s( dest );
    if ( s ) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[ 128 ];
        char* d = std::end( buffer );
        do
        {
            -- d;
            *d = "0123456789"[ tmp % 10 ];
            tmp /= 10;
        } while ( tmp != 0 );
        if ( value < 0 ) {
            -- d;
            *d = '-';
        }
        int len = std::end( buffer ) - d;
        if ( dest.rdbuf()->sputn( d, len ) != len ) {
            dest.setstate( std::ios_base::badbit );
        }
    }
    return dest;
}

int main() {
	std::vector<int> fact_table(1000001);
	for (int i = 2; i <= 1000000; i++)
		if (!fact_table[i]) for (int j = 2; j <= 1000000 / i; j++) fact_table[i * j] = i;
	
	int n = ri();
	int a[n];
	for (int i = 0; i < n; i++) a[i] = ri();
	std::vector<mint> cnt(1000001);
	for (int i = 0; i < n; i++) cnt[a[i]] += a[i];
	
	std::vector<std::vector<int> > divs(1000001);
	divs[1] = {1};
	for (int i = 2; i <= 1000000; i++) {
		std::map<int, int> cur_yaku;
		int cur = i;
		while (fact_table[cur]) {
			cur_yaku[fact_table[cur]]++;
			cur /= fact_table[cur];
		}
		if (cur > 1) cur_yaku[cur]++;
		
		std::vector<int> cur_divs{1};
		for (auto &j : cur_yaku) {
			std::vector<int> next = cur_divs;
			int tmp = 1;
			for (int k = 1; k <= j.second; k++) {
				tmp *= j.first;
				for (auto l : cur_divs) next.push_back(l * tmp);
			}
			std::swap(next, cur_divs);
		}
		
		divs[i] = cur_divs;

/*
		if (i <= 50) {
			for (auto j : divs[i]) std::cerr << j << " ";
			std::cerr << std::endl;
		}*/
	}
	
	auto converted = cnt;
	for (int x = 1; x <= 1000000; x++) {
		for (int y : divs[x]) {
			if (y != x) converted[y] += converted[x];
		}
	}
	for (auto &i : converted) i *= i;
	for (int x = 1000000; x >= 1; x--) {
		for (int y : divs[x]) {
			if (y != x) converted[y] -= converted[x];
		}
	}
	for (int i = 0; i < n; i++) converted[a[i]] -= (int64_t) a[i] * a[i];
	mint ans = 0;
	for (int i = 1; i <= 1000000; i++) {
		ans += converted[i] / 2 / i;
		// if (converted[i]) std::cerr << i << ":" << converted[i] << std::endl;
	}
	std::cout << ans << std::endl;
	
	
	return 0;
	
	return 0;
}


Measured memory_bytes: 108928