#include<bits/stdc++.h> using namespace std; const int N = 1e6+10,md=998244353; #define int long long int t,n,a[N],isprime[N],prime[N],c,maxn,vis[N]; vector<int> G[N]; struct T{ int l; int r; }b[N]; signed main(){ ios::sync_with_stdio(false); cin>>t; for(int i=2;i<=N-10;i++){ if(!isprime[i]){ prime[++c]=i; } for(int j=1;j<=c;j++){ if(i*prime[j]>(N-10)){ break; } isprime[i*prime[j]]=1; if(i%prime[j]) break; } } while(t--){ cin>>n; maxn=0; for(int i=1;i<=c;i++){ G[prime[i]].clear(); vis[i]=0; } for(int i=1;i<=n;i++){ cin>>a[i]; maxn=max(maxn,a[i]); } int h=0,last=0; for(int i=1;i<=c;i++){ if(prime[i]>maxn) break; for(int j=1;j<=n;j++){ if(prime[i]>a[j]) continue; int tmp=0; while(a[j]%prime[i]==0){ tmp++; a[j]/=prime[i]; } if(tmp){ G[prime[i]].push_back(tmp); if(h==0) h=i; if(!vis[i]){ if(last) b[last].r=i; if(last) b[i].l=last; last=i; vis[i]=1; } } } } for(int i=h;i!=0;i=b[i].r){ sort(G[prime[i]].begin(),G[prime[i]].end(),greater<int>()); } int ans=0; for(int i=1;i<=n;i++){ int tmp=1,h2=0; for(int j=h;j!=0;j=b[j].r){ if(G[prime[j]].size()){ tmp=tmp%md*pow(prime[j],G[prime[j]][0]); G[prime[j]].erase(G[prime[j]].begin()); if(G[prime[j]].size()&&h2==0) h2=j; } } h=h2; ans=(ans%md+tmp%md)%md; } cout<<ans<<endl; /* for(int i=1;i<=maxn;i++){ for(int j=0;j<G[prime[i]].size();j++){ cout<<G[prime[i]][j]<<" "; } cout<<endl; } */ } return 0; }