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

inline int read(){
    int x=0,f=1;char cc=getchar();
    while(cc<'0' || cc>'9') {if(cc=='-') f=-1;cc=getchar();}
    while(cc>='0' && cc<='9') {x=x*10+cc-'0';cc=getchar();}
    return x*f;
}

int n,a[1010],f[1000010],ans;

inline int ksm(int a,int b){
    int tmp=1;
    while(b){
        if(b&1) tmp=(1ll*tmp*a)%mod;
        a=(1ll*a*a)%mod;
        b>>=1;
    }
    return tmp;
}

int main(){
    for(int tt=read();tt;tt--){
        n=read();
        for(int i=1;i<=n;i++) a[i]=read();
        ans=a[1]>>1;
        for(int k=2;k<=n;k++){
            for(int i=0;i<a[k-1]*a[k];i++)
            if((i/a[k])%2==0) f[i]=1;else f[i]=0;
            int inv=ksm(a[k-1],mod-2);
            inv=(1ll*ksm(2,mod-2)*inv)%mod;
            int num=0;
            for(int i=0;i<=a[k-1];i++) num+=f[i];
            for(int i=0;i<a[k-1]*a[k];i++){
                if(num==0) ans=(ans+inv)%mod;
                num-=f[i];num+=f[(i+a[k-1]+1)%(a[k-1]*a[k])];
            }
        }
        printf("%d\n",ans);
    }
}