#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int>ttfa;
typedef long long ll;

const ll P=998244353;
inline ll fpr(ll b,ll t=P-2,ll x=1ll){
	for(;t;t>>=1,b=b*b%P)
		if(t&1)x=x*b%P;
	return x;
}
const int N=3003,R=1<<16;
const ll pri[16]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
int n,id[N];
struct node{
	ll val,res;int sta;
	void calc(){
		res=val;
		for(int i=0,x=pri[i];i<16;++i,x=pri[i]){
			while(res%x==0){
				res/=x;
				sta|=1<<id[x];
			}
		}
	}
}a[N];
bool cmp(node x,node y){return x.res<y.res;}
ll dp[R],tmp[R],ans;
int main(){
	for(int i=0;i<16;++i)id[pri[i]]=i;
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d",&a[i]);
		a[i].calc();
		//printf("%d %lld\n",a[i].sta,a[i].res);
	}
	sort(a+1,a+1+n,cmp);
	dp[0]=1ll;
	for(int i=1;i<=n;++i){
		memset(tmp,0,sizeof(tmp));
		for(int s=R-1;s>=0;--s)
			tmp[s|a[i].sta]=(tmp[s|a[i].sta]+dp[s]*a[i].val)%P;
		ll k=a[i].res==1?1:(a[i].res-1)*fpr(a[i].res)%P;
		for(int s=0;s<R;++s)
			dp[s]=(dp[s]+tmp[s]*k%P)%P;
	}
	for(int i=0;i<16;++i){
		ll x=(pri[i]-1)*fpr(pri[i])%P;
		for(int s=0;s<R;++s)
			if((s>>i)&1)dp[s]=dp[s]*x%P;
	}
	for(int s=0;s<R;++s)ans=(ans+dp[s])%P;
	printf("%lld\n",ans);
	return 0;
}