#include<bits/stdc++.h>
using namespace std;

const int mod=1e9+7;
const int maxn=15;
int T,n;
int a[maxn],b[maxn];

int power(int x,int pow){
    int res=1;
    for(;pow;pow>>=1){
        if(pow&1)res=1LL*res*x%mod;
        x=1LL*x*x%mod;
    }
    return res;
}

int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        int tot=0;
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            tot+=a[i]/2;
            b[i]=power(a[i],mod-2);
        }
        int ans=0;
        for(int i=1;i<=n-1;i++){
            int cnt=a[i+1]/a[i]+1;
            int val=0;
            if(!(cnt&1))
                val=(cnt/2+1LL*(b[i]+mod-1LL*(cnt-1)*b[i+1]%mod)*(a[i+1]/2))%mod;
            else
                val=((cnt+1)/2+1LL*(b[i]+mod-1LL*cnt*b[i+1]%mod)*(a[i+1]/2))%mod; 
            ans=(ans+1LL*val*(a[i]/2))%mod;
        }
        printf("%d\n",(tot-ans+mod)%mod);
    }
    return 0;
}