#include<bits/stdc++.h> using namespace std; long long t,a[1000006],n,mod=998244353; int main(){ //freopen("inequality.in","r",stdin); //freopen("inequality.out","w",stdout); scanf("%lld",&t); while(t--){ scanf("%lld",&n); long long nmax=0; for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); } for(int i=1;i<=n;i++){ for(int j=i+1;j<=n;j++){ long long t=__gcd(a[i],a[j]); a[j]=a[i]*a[j]/t; a[i]=t; a[i]%=mod; a[j]%=mod; } } for(int i=1;i<=n;i++){ nmax+=a[i]; nmax%=mod; } printf("%lld\n",nmax); } }