#include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(x) setprecision(x)<<fixed
#define ss second
#define fori(v) for(lli i=0; i<v; i++)
#define forj(v) for(lli j=0; j<v; j++)
#define fork(v) for(lli k=0; k<v; k++)
#define forl(v) for(lli l=0; l<v; l++)
#define fort(v) for(lli t=0; t<v; t++)
#define forz(v) for(lli z=0; z<v; z++)
#define lli long long int
#define MAX 100010
#define double long double
#define pb push_back
int inf = pow(10,9);
lli modulo = pow(10,9)+7;
double eps = 1e-11;
ifstream in;
ofstream out;
//#define cin in
//#define cout out
bool prime[MAX] 	= {};
int  divisors[MAX]	= {};
int  appear[MAX] = {};
void init(){
	fori(MAX)
		appear[i] = 0;
}
void sieve(){
	for(int i=2; i<MAX; i++)
		prime[i] = 1;
	for(int i=2;i<MAX; i++)
		if(prime[i])
			for(int j=i; j<MAX; j+=i)
				prime[j] = 0, divisors[j]++;
}
void deal(){
	sieve();
	int t;
	cin>>t;
	assert(t<=10);
	forl(t){
		init();
		int n;
		cin>>n;
		assert(n<=pow(10,5));
		fori(n){
			int ed;
			cin>>ed, appear[ed]++;
			assert(ed<=pow(10,5));
			assert(ed>=1);
		}
		lli mx = 0;
		for(int i=2; i<MAX; i++){
			int number = 0;
			for(int j=i; j<MAX; j+=i)
				number+=appear[j];
			lli ans = (lli)number*(lli)divisors[i];
			mx = max(mx,ans);
		}
		cout<<mx<<'\n';
	}
}
int main(){
//	freopen("i1.txt", "r", stdin);
//	freopen("o1.txt", "wb", stdout);
	deal();
}