#include<cstdio>
#include<cstring>
#include<cassert>
#include<vector>
#include<list>
#include<queue>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<fstream>
#include<typeinfo>
#include<locale>
#include<iterator>
#include<valarray>
#include<complex>
#include<climits>

using namespace std;

#define xx         first
#define yy         second
#define pb         push_back
#define mp         make_pair
#define LL         long long
#define inf        INT_MAX/3
#define mod        100000007ll
#define PI         acos(-1.0)
#define linf       (1ll<<60)-1
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define REP(I,N)   FOR(I,0,N)
#define ALL(A)     ((A).begin(), (A).end())
#define set0(ar)   memset(ar,0,sizeof ar)
#define vsort(v)   sort(v.begin(),v.end())
#define setinf(ar) memset(ar,126,sizeof ar)

//cout << fixed << setprecision(20) << p << endl;

template <class T> inline T bigmod(T p,T e,T M){
    LL ret = 1;
    for(; e > 0; e >>= 1){
        if(e & 1) ret = (ret * p) % M;
        p = (p * p) % M;
    } return (T)ret;
}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T modinverse(T a,T M){return bigmod(a,M-2,M);}

LL dp[1001][1001], ar[1001];
int gcd_val[1001][1001];

LL go(int c, int val){
    if(c == 0) return val;
    LL &ret = dp[c][val];
    if(ret != -1) return ret;
    ret = 0;
    ret = go(c - 1, val);
    ret = (ret + go(c - 1, gcd_val[val][ar[c]])) % mod;

    return ret;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    REP(i, 1001) REP(j, 1001) gcd_val[i][j] = gcd(i, j);
    int T; cin >> T;
    while(T--){
        int n; cin >> n;
        FOR(i, 1, n+1) cin >> ar[i];
        memset(dp, -1, sizeof dp);
        cout << go(n, 0) << endl;
    }
}