#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()

const int N = 2005;
const int M = 3005;
const int p = 998244353;

int pr[3005],tot,mk[3005],mi[3005];
int inv[3005], id[M], a[N], b[N], c[N], rk[N];
// 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53

void init()
{
    for (int i=(inv[0]=inv[1]=1)+1; i<M; ++i) inv[i]=(ll)(p-p/i)*inv[p%i]%p;
    for (int i=2;i<M;++i) 
    {
        if (!mk[i]) { pr[++tot] = i; mi[i]=i; id[i]=tot;}
        for (int j=1; j<=tot&&(ll)pr[j]*i<M; ++j)
        {
            mk[pr[j]*i]=1; mi[pr[j]*i]=pr[j];
            if (i%pr[j]==0) break;
        }
    }
    // for(int i=1;i<=16;++i) cout<<pr[i]<<",";
}

int upd[1<<16|5], f[1<<16|5], mo[1<<16|5];

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    init();
    int n; cin>>n;
    mo[0] = 1;
    int all=1<<16;
    for(int i = 1; i < all; ++i)
    {
        int j=i&-i; int idj=31-__builtin_clz(j);
        mo[i] = (ll)mo[i^j]*inv[pr[idj+1]]%p*(pr[idj+1]-1)%p;
    }
    for (int i=1; i<=n; ++i)
    {
        cin>>a[i];
        int x=a[i];
        b[i] = 0;
        c[i] = 1;
        rk[i] = i;
        while(x != 1)
        {
            int y=mi[x];
            if(id[y]<=16) 
            {
                b[i]|=(1<<(id[y]-1));
            }
            else c[i]*=y;
            while(x%y==0) x/=y;
        }
    }
    sort(rk+1, rk+n+1, [&](int x, int y) -> bool { return c[x] < c[y]; });
    f[0] = 1;
    for (int i=1; i<=n; ++i)
    {
        int j=i;
        vector<int> tmp; tmp.push_back(rk[i]);
        int C=c[rk[i]];
        while(j+1<=n && c[rk[j+1]]==C) tmp.push_back(rk[++j]);
        // all
        for(int s=0; s<all; ++s) upd[s]=f[s];
        for(auto I : tmp)
        {
            for(int s=all-1; s>=0; --s) if(f[s])
            {
                (f[s|b[I]]+=(ll)f[s]*a[I]%p)%=p;
            }
        }
        if (C!=1)
        {
            for(int s=0; s<all; ++s) f[s]=(upd[s]+(ll)((f[s]-upd[s])%p+p)%p*(C-1)*inv[C]%p)%p;
        }
        i=j;
    }
    int ans=0;
    for(int i=0;i<all;++i) (ans+=((ll)f[i]*mo[i]%p))%=p;
    cout << ans << "\n";
}