#include"bits/stdc++.h"
#define endl '\n'
using ll=long long;
using namespace std;
constexpr int N=1e5+10,inf=0X3F3F3F3F,mod=998244353;
constexpr ll INF=0X3F3F3F3F3F3F3F3F;
ll qpow(ll a,ll b,ll p=mod){
    ll r=1;
    for(;b;b>>=1){
        if(b&1)
            r=r*a%p;
        a=a*a%p;
    }
    return r;
}
ll inv(ll a,ll p=mod){
    return qpow(a,mod-2);
}
int pr[16]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
void solve(){
    int n;
    cin>>n;
    vector<int>a(n);
    vector<vector<array<int,2>>>p(3001);
    for(int i=0;i<n;i++){
        cin>>a[i];
        int w=a[i];
        int mask=0;
        for(int j=0;j<16;j++){
            if(w<pr[j])
                break;
            if(w%pr[j]==0)
                mask|=1<<j;
            while(w%pr[j]==0)
                w/=pr[j];
        }
        p[w].push_back({a[i],mask});
    }
    
    vector<ll>f(1<<16),g(1<<16);
    f[0]=1;
    for(int i=1;i<=3000;i++){
        if(p[i].empty())
            continue;
        fill(g.begin(),g.end(),0);
        for(auto [val,mask]:p[i]){
            for(int s=(1<<16)-1;s>=0;s--){
                (g[s|mask]+=(f[s]+g[s])*val)%=mod;
            }
        }
        ll val=1?i==1:(i-1)*inv(i);
        for(int s=0;s<(1<<16);s++){
            (f[s]+=g[s]*val)%=mod;
        }
    }

    ll ans=0;
    for(int s=0;s<(1<<16);s++){
        for(int i=0;i<16;i++){
            if(s>>i&1)
                (f[s]*=(pr[i]-1)*inv(pr[i]))%=mod;
        }
        (ans+=f[s])%=mod;
    }
    cout<<ans<<endl;
}
signed main(){
    cin.tie(nullptr)->sync_with_stdio(0);
//	int t;cin>>t;while(t--)
    solve();
    return 0;
}