#include<cstdio>
#include<algorithm>
const int N = 3010, mod = 998244353, Sq = 55, M = 16;
int n, a[N];
int p[M] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int f[2][(1 << M) + 10][2];
int inv[N];
struct num {
    int stu;
    int bigp;
    int data;
    bool operator< (const num &oth) {
        return bigp < oth.bigp;
    }
}c[N];
int main() {
    inv[1] = 1;
    for(int i = 2; i <= 3000; i++) {
        inv[i] = mod - 1ll * inv[mod % i] * (mod / i) % mod;
    }
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        c[i].data = a[i];
        int x = a[i], y = 0;
        for(int j = 0; j < 16; j++) {
            if(x % p[j] == 0) {
                y |= (1 << j);
                while(x % p[j] == 0) x /= p[j];
            }
        }
        c[i].bigp = x;
        c[i].stu = y;
    }
    std::sort(c + 1, c + 1 + n);
    f[0][0][0] = 1;
    for(int i = 1; i <= n; i++) {
        if(c[i].bigp != c[i - 1].bigp) {
            for(int j = 0; j < (1 << 16); j++) {
                f[i&1^1][j][0] = (f[i&1^1][j][0]+1ll*f[i&1^1][j][1]*(c[i-1].bigp==1?1:inv[c[i-1].bigp]%mod*(c[i-1].bigp-1)))%mod;
                f[i&1^1][j][1] = 0;
            }
        }
        for(int j = 0; j < (1 << 16); j++) {
            f[i&1][j][0] = f[i&1^1][j][0];
            f[i&1][j][1] = f[i&1^1][j][1];
        }
        for(int j = 0; j < (1 << 16); j++) {
            f[i&1][j|c[i].stu][1] = (f[i&1][j|c[i].stu][1] + 1ll*(f[i&1^1][j][0]+f[i&1^1][j][1])*c[i].data)%mod;
        }
        // printf("##%d: %d %d\n", i, c[i].stu, c[i].data);
        // for(int j = 0; j < (1 << 3); j++) {
        //     printf("%d %d\n", j, f[i&1][j][1]);
        // }
    }
    int ans = 0;
    for(int j = 0; j < (1 << 16); j++) {
        int now = (f[n&1][j][0] + 1ll*f[n&1][j][1]*(c[n].bigp==1?1:inv[c[n].bigp]%mod*(c[n].bigp-1)))%mod;
        // printf("%d %d\n", j, now);
        for(int k = 0; k < 16; k++) {
            if((j >> k) & 1) {
                now = 1ll * now * inv[p[k]] % mod * (p[k] - 1) % mod;
            }
        }
        ans = (ans + now) % mod;
    }
    printf("%d\n", ans);
    return 0;
}