#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define log(x) (31^__builtin_clz(x))
#define lowbit(x) (x&-x)
using namespace std;
const int maxn=3005,p=998244353;
vector<int>y[maxn];
int notpri[maxn],ct[maxn];
int qr[maxn];
ll num[30],inv[30];
void init() {
	int n=3000;
	int tot=0;
	y[1]={0};
	for(int i=2;i<=n;i++){
		if(notpri[i])continue;
		if(tot>16)tot=16;
		ct[i]=tot;
		num[tot]=i;
		tot++;
		for(int j=i;j<=n;j+=i){
			y[j].push_back(i);
			notpri[j]=1;
			qr[j]|=1<<ct[i];
		}
	}
}
ll qpow(ll x,ll y){
	ll s=1;
	while(y){
		if(y&1)s=s*x%p;
		x=x*x%p;
		y>>=1;
	}
	return s;
}
ll a[3005];
ll add[(1<<17)+5];
bool cmp(int a,int b){
	return y[a].back()<y[b].back();
}
void solve(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+n+1,cmp);
	vector<int>dp1((1<<17)+5),dp2;
	dp1[0]=1;
	for(int i=1;i<=n;i++){
		if(i>1&&y[a[i]].back()>54&&y[a[i]].back()!=y[a[i-1]].back()){
			for(int j=(1<<16);j<(1<<17);j++){
				dp1[j^(1<<16)]+=dp1[j];
				if(dp1[j^(1<<16)]>=p)dp1[j^(1<<16)]-=p;
				dp1[j]=0;
			}
		}
		if(y[a[i]].size())num[16]=y[a[i]].back();
		add[0]=1;
		for(int j=0;j<17;j++){
			inv[j]=qpow(num[j],p-2);
		}
		for(int j=1;j<(1<<17);j++){
			add[j]=add[j^lowbit(j)]*(num[log(lowbit(j))]-1)%p*inv[log(lowbit(j))]%p;
		}
		dp2=dp1;
		for(int j=0;j<(1<<17);j++){
			dp2[j|qr[a[i]]]=(dp2[j|qr[a[i]]]+dp1[j]*add[qr[a[i]]^(j&qr[a[i]])]%p*a[i]%p)%p;
		}
		dp1=dp2;
	}
	ll ans=0;
	for(auto u:dp1)ans+=u;
	cout<<ans%p<<"\n";
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0);
	init();
	int t=1;
	// cin>>t;
	while(t--)solve();
	return 0;
}
/*
8
500 500 1 1 1 1 1 1
*/