#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll mod=998244353;
constexpr int pr[16]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53},ipr[16]={499122177, 665496236, 399297742, 142606337, 725995894, 537516191, 58720257, 893166001, 781234712, 516333287, 869438631, 755428160, 900854661, 487514685, 807091180, 169513193};
constexpr int N=1<<16;
ll f[N],g[N];
vector<int> w[3005];
int a[2005],n,msk[2005],mx;
ll sb[N];
int main(){
    std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        int x=a[i],y=0;
        for(int i=0;i<16;i++)if(x%pr[i]==0){
            while(x%pr[i]==0) x/=pr[i];
            y|=1<<i;
        }
        msk[i]=y;w[x].push_back(i);
    }
    f[0]=1;
    for(int _=1;_<=3000;_++)if(!w[_].empty()){
        memset(g,0,sizeof g);
        for(int i:w[_]){
            int sk=msk[i],val=a[i],vv=(_==1?a[i]:a[i]/_*(_-1));
            for(int i=N-1;i>=0;i--) g[i|sk]=(g[i|sk]+g[i]*val+f[i]*vv)%mod;   
        }
        for(int i=0;i<N;i++) f[i]=(f[i]+g[i])%mod;
    }
    ll ans=f[0];sb[0]=1;
    for(int i=1;i<N;i++){
        int z=__builtin_ctz(i);sb[i]=sb[i^1<<z]*ipr[z]%mod;
        ans+=f[i]*sb[i]%mod;
    }
    cout<<ans<<'\n';
}