#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}




//_ ***************************** START Below *******************************




vector<int> a;

int bruteforce(int n){

    unordered_map<int,int> mp;
    for(int i=0; i<n; i++){
        mp[a[i]]++;
    }

    int maxi = 0;
    for(int i=1; i<=n; i++){
        int ct = 0;

        ct += mp[i];
        if(i!=1) ct += mp[1];


        for(int j=2; j*j<=i; j++){
            if(i%j != 0) continue;

            ct += mp[j];

            if(j != i/j){
                ct += mp[i/j];
            }
        }
        maxi = max(maxi, ct);
    }

    return maxi;
}






int consistency(int n){

    vector<int> freq(n+1, 0);
    vector<int> seive(n+1, 0);

    for(int i=0; i<n; i++){
        if(a[i] > n) continue;
        freq[a[i]]++;
    }


    for(int i=1; i<=n; i++){
        if(freq[i] == 0) continue;

        for(int j=1*i; j<=n; j+=i){
            seive[j] += freq[i];
        }
    }

    int maxi = 0;
    for(int i=1; i<=n; i++){
        maxi = max(maxi, seive[i]);
    }

    return maxi;
}










int practice(int n){


    return 0;
}





void solve() {

    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}