#include <bits/stdc++.h> #define int long long using namespace std; const int md = 998244353; int t,n,a[114514]; int gcd (int x,int y) { if (x == 0) { return y; } return gcd(y % x,x); } signed main () { scanf("%lld",&t); while (t--) { scanf("%lld",&n); for (int i = 1;i <= n;i++) { scanf("%lld",&a[i]); } sort(a + 1,a + n + 1); for (int i = 1;i <= n;i++) { for (int j = i + 1;j <= n;j++) { int x = a[i] % md,y = a[j] % md; int g = gcd(x,y); a[i] = g; a[j] = x * y / g % md; } } int ans = 0; for (int i = 1;i <= n;i++) { ans += a[i]; ans %= md; } printf("%lld\n",ans); } return 0; }