#include<bits/stdc++.h>
const int mo = 998244353;
const int maxm = 3e3 + 5; 
const int maxn = 2e3 + 5;
const int maxk = 1 << 16;
using namespace std;
int n, a[maxn], st[maxn], m, val[maxm], lim = (1 << 16), sum[maxk], inv[20];
int prime[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int f[3][maxk], g[3][maxk];
vector<int>t[maxm];
int div(int x){
    for (int i = 0; i <= 15; i++)
        while(x % prime[i] == 0) x /= prime[i];
    return x;
}
int ksm(int x, int y){
    int res = 1;
    for (; y; y >>= 1, x = 1LL * x * x %mo)if (y & 1) res = 1LL * res * x % mo;
    return res;
}
int main(){
    for (int i = 0; i < 16; i++)inv[i] = ksm(prime[i], mo - 2);
    for (int i = 0; i < lim; i++){
        sum[i] = 1;
        for (int j = 0; j < 16; j++)
            if (i >> j & 1)
                sum[i] = 1LL * sum[i] * inv[j] % mo * (prime[j] - 1) % mo;
    }
    scanf("%d", &n);
    for (int i = 1; i <= n; i++){
        scanf("%d", &a[i]);
        int num = div(a[i]);
        for (int j = 0; j < 16; j++)
            if (a[i] % prime[j] == 0) val[a[i]] |= 1 << j;
        t[num].push_back(a[i]);
        st[++m] = num;
    }
    sort(st + 1, st + m + 1); m = unique(st + 1, st + m + 1) - st - 1;
    int cnt = 0;
    f[0][0] = 1;
    for (int i = 1; i <= m; i++){
        int P = (st[i] == 1) ? 1 : 1LL * (st[i] - 1) * ksm(st[i], mo - 2) % mo;
        for (int j = 0; j < lim; j++) g[0][j] = g[1][j] = 0;
        for (auto x: t[i]){
            int num = (++cnt) & 1;
            for (int j = 0; j < lim; j++)f[num][j] = f[num ^ 1][j], g[num][j] = g[num ^ 1][j];
            for (int j = 0; j < lim; j++){
                int k = j | val[x];
                g[num][k] = (g[num][k] + 1LL * f[num ^ 1][j] * x % mo * P % mo) % mo;
                g[num][k] = (g[num][k] + 1LL * g[num ^ 1][j] * x % mo) % mo;
            }
        } 
        int num = cnt & 1;
        for (int j = 0; j < lim; j++)f[num][j] = (f[num][j] + g[num][j]) % mo;      
    }
    int ans = 0;
    for (int i = 0; i < lim; i++)
        ans = (ans + 1LL * f[n & 1][i] * sum[i] % mo) % mo;
    printf("%d\n", ans);
    return 0;
}