#include <bits/stdc++.h>
using namespace std;
const int mod=1000000007;
int cas,n,a[15];
inline int ksm(int x,int n) {
    int ret=1;
    while (n) {
        if (n&1) ret=1ll*ret*x%mod;
        n>>=1;
        x=1ll*x*x%mod;
    }
    return ret;
}
inline int solve(int a,int b) {
    int tmp=0,tot=ksm(2*b,mod-2);
    for (int i=0;i<2*b;++i)
        for (int j=0;j<b/2;++j) {
            int l=((2*j*a+i)%(a*b))%(2*b);
            if (l>=b&&l<b+b-a) {
                ++tmp;
                //printf("i=%d j=%d l=%d\n",i,j,l);
            }
        }
    return 1ll*tmp*tot%mod;
}
int main()
{
    scanf("%d",&cas);
    while (cas--) {
        scanf("%d",&n);
        for (int i=1;i<=n;++i) scanf("%d",&a[i]);
        int res=a[1]/2;
        for (int i=2;i<=n;++i)
            res=(res+solve(a[i-1],a[i]))%mod;
        printf("%d\n",res);
    }
    return 0;
}