#include<bits/stdc++.h>
using namespace std;
const int N=3005,M=66000,P=998244353;
int n;
int pri[N]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
struct node{
    int a;
    int b,ma;
}a[N];
bool cmp(node a,node b){
    return a.ma<b.ma;
}
int f[M],g[M];
int pw(int x,int k){
    int ans=1;
    for(;k;k>>=1,x=1ll*x*x%P){
        if(k&1) ans = 1ll*ans*x%P;
    }
    return ans;
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i].a);
        a[i].ma=a[i].a;
        a[i].b=0;
        for(int j=0;j<16;j++){
            while(a[i].ma%pri[j]==0){
                a[i].ma/=pri[j];
                a[i].b|=(1<<j);
            }
        }
    }
    sort(a+1,a+n+1,cmp);
    f[0]=1;
    int l=n+1,r;
    for(int i=1;i<=n;i++){
        if(a[i].ma>1){
            l=i;
            break;   
        }
        for(int j=65535;j>=0;j--){
            f[j|a[i].b]=(f[j|a[i].b]+1ll*f[j]*a[i].a%P)%P;
        }
    }
    while(l<=n){
        r=l;
        while(r+1<=n and a[r+1].ma==a[l].ma) r++;
        memcpy(g,0,sizeof g);
        for(int i=l;i<=r;i++){
            for(int j=65535;j>=0;j--){
                g[j|a[i].b]=(g[j|a[i].b]+1ll*f[j]*a[i].a%P+1ll*g[j]*a[i].a%P)%P;
            }
        }
        int inv = 1ll*pw(a[l].ma,P-2)*(a[l].ma-1)%P;
        for(int j=65535;j>=0;j--){
            f[j]=(f[j]+1ll*g[j]*inv%P)%P;
        }
        l=r+1;
    }
    int ans=0;
    for(int j=0;j<65536;j++){
        int inv =1;
        for(int k=0;k<16;k++){
            if((j>>k)&1){
                inv =1ll*inv*(pri[k]-1)%P*pw(pri[k],P-2)%P;
            }
        }
        // if(f[j]) printf("%d %d %d\n",j,inv,f[j]);
        ans = (ans + 1ll*inv*f[j]%P)%P;
    }
    printf("%d",ans);
    return 0;
}