#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],minn[N]; vector<int> G[N]; struct T{ int l; int r; }b[N]; signed main(){ ios::sync_with_stdio(false); cin>>t; minn[1]=1; for(int i=2;i<=N-10;i++){ if(!isprime[i]){ prime[++c]=i; minn[i]=i; } for(int j=1;j<=c;j++){ if(i*prime[j]>(N-10)){ break; } isprime[i*prime[j]]=1; minn[i*prime[j]]=min(minn[i],prime[j]); if(i%prime[j]==0) break; } } while(t--){ cin>>n; maxn=0; for(int i=1;i<=c;i++){ G[prime[i]].clear(); vis[i]=0; } int h=0,last=0; for(int i=1;i<=n;i++){ cin>>a[i]; maxn=max(maxn,a[i]); while(a[i]!=1){ int y=minn[a[i]],tmp=0; while(a[i]%y==0){ tmp++; a[i]/=y; } if(tmp) G[y].push_back(tmp); if(h==0) h=y; if(!vis[y]){ if(last) b[last].r=y; if(last) b[y].l=last; last=y; vis[y]=1; } } } /* for(int i=h;i!=0;i=b[i].r){ cout<<i<<" "; } cout<<endl; */ for(int i=h;i!=0;i=b[i].r){ sort(G[i].begin(),G[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[j].size()){ tmp=tmp%md*pow(j,G[j][0]); G[j].erase(G[j].begin()); if(G[j].size()&&h2==0) h2=j; if(!G[j].size()){ b[b[j].l].r=b[j].r; b[b[j].r].l=b[j].l; } } } h=h2; ans=(ans%md+tmp%md)%md; } cout<<ans<<endl; } return 0; }