#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define inf 0x3f3f3f3f
#define ull unsigned long long
#define pll pair<ll,ll>
#define ls d*2
#define rs d*2+1
#define mid (l+r)/2
#define lowbit(x) (x&(-x))
//#define endl "\n"
#define all(x) x.begin(),x.end()
#define int long long
//mt19937 seed;
//uniform_int_distribution<int>num(0,2e9);
const int N=2e5+10;
const int M=33;
int mod=998244353;
int dp[1<<17];
int prime[20]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,1};
int qp(int x,int y){
int re=1;
while(y){
if(y&1)re=re*x%mod;
x=x*x%mod;
y>>=1;
}
return re;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int _=1;//cin>>_;
while(_--){
int n;
cin>>n;
map<int,vector<pll>>mp;
for(int i=0;i<n;i++){
int x;
cin>>x;
int num=0,sum=1;
for(int j=0;j<16;j++){
while(x%pri[j]==0)num|=(1<<j),sum*=pri[j],x/=pri[j];
}
mp[x].push_back({num,sum});
}
dp[0]=1;
for(auto [x,vec]:mp){
pri[16]=x;
for(auto [num,sum]:vec){
if(x!=1)num|=(1<<16);
for(int i=(1<<17)-1;i>=0;i--){
if(i>>16&1)dp[i|num]=(dp[i|num]+dp[i]*sum%mod*x%mod)%mod;
else dp[i|num]=(dp[i|num]+dp[i]*sum%mod*max(x-1,1ll)%mod)%mod;
}
}
for(int i=(1<<16);i<(1<<17);i++){
dp[i-(1<<16)]=(dp[i-(1<<16)]+dp[i])%mod;
dp[i]=0;
}
}
int ans=0;
for(int i=0;i<(1<<17);i++){
for(int j=0;j<16;j++){
if(i>>j&1){
dp[i]=dp[i]*(pri[j]-1)%mod;
dp[i]=dp[i]*qp(pri[j],mod-2)%mod;
}
}
ans=(ans+dp[i])%mod;
}
cout<<ans<<'\n';
}
}