#include<bits/stdc++.h>
#define ll long long
#define MOD(X) ((X)>=Mod?(X)-Mod:(X))
using namespace std;
const ll Mod=998244353;
const int Maxstate=(1<<16);
ll Pow(ll X,ll K)
{
    ll Res=1;
    ll Times=X;
    while(K)
    {
        if(K&1)Res=Res*Times%Mod;
        Times=Times*Times%Mod;
        K>>=1;
    }
    return Res;
}
int N;
int Prime[17]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
struct num
{
    ll Num;
    ll Maxf;
    int State;
}A[2001];
ll DP[2][(1<<16)+10][2];
ll Invv[17];
bool Cmp(num &B,num &C)
{
    return B.Maxf<C.Maxf;
}
int main()
{
    for(int i=0;i<16;++i)
    Invv[i]=Pow(Prime[i],Mod-2)*(Prime[i]-1)%Mod;
    scanf("%d",&N);
    for(int i=1;i<=N;++i)
    {
        scanf("%d",&A[i].Num);
        ll Copy=A[i].Num;
        for(int j=0;j<16;++j)
        {
            if(Copy%Prime[j]==0)
            A[i].State|=(1<<j);
            while(Copy%Prime[j]==0)
            Copy/=Prime[j];
        }
        A[i].Maxf=Copy;
    }
    sort(A+1,A+N+1,Cmp);
    DP[0][0][0]=1;
    for(int i=1;i<=N;++i)
    {
        memset(DP[i&1],0,sizeof(DP[i&1]));
        if(i>1&&A[i-1].Maxf>1&&A[i].Maxf!=A[i-1].Maxf)
        {
            ll Inv=Pow(A[i-1].Maxf,Mod-2);
            for(int j=0;j<Maxstate;++j)
            {
                DP[!(i&1)][j][0]=MOD(DP[!(i&1)][j][0]+DP[!(i&1)][j][1]*(A[i-1].Maxf-1)%Mod*Inv%Mod);
                DP[!(i&1)][j][1]=0;
            }
        }
        for(int j=0;j<Maxstate;++j)
        {
            DP[i&1][j][0]=DP[!(i&1)][j][0];
            DP[i&1][j][1]=MOD(DP[i&1][j][1]+DP[!(i&1)][j][1]);
            DP[i&1][j|A[i].State][1]=(DP[i&1][j|A[i].State][1]+(DP[!(i&1)][j][0]+DP[!(i&1)][j][1])*A[i].Num%Mod)%Mod;
        }
    }
    ll Ans=0;
    ll Inv=(A[N].Maxf>1?(Pow(A[N].Maxf,Mod-2)*(A[N].Maxf-1)%Mod):1);
    for(int i=0;i<Maxstate;++i)
    {
        ll Now=(DP[N&1][i][0]+DP[N&1][i][1]*Inv%Mod)%Mod;
        for(int j=0;j<16;++j)
        if(i&(1<<j))
        Now=Now*Invv[j]%Mod;
        Ans+=Now;
    }
    printf("%lld\n",Ans%Mod);
}