#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const LL mod=1e9+7;
LL inv(LL x){return x==1?1:(mod-mod/x)*inv(mod%x)%mod;}
void solve(){
    LL n; cin>>n;
    vector<LL> a(n+1),sz(n+1),ls(n+1),rs(n+1);
    stack<LL> stk;
    stk.push(0); a[0]=n;
    for (LL i=1;i<=n;++i){
        cin>>a[i];
        for (;!stk.empty()&&a[stk.top()]<a[i];stk.pop()){
            ls[i]=stk.top();
        }
        rs[stk.top()]=i;
        stk.push(i);
    }
    function<LL(LL)> dfs=[&](LL x){
        if (!x) return 1LL;
        LL lc=dfs(ls[x]);
        LL rc=dfs(rs[x]);
        sz[x]=sz[ls[x]]+sz[rs[x]]+1;
        return lc*rc%mod*sz[x]%mod;
    };
    LL ans=dfs(rs[0]);
    ans=inv(ans)*inv(2)%mod*n%mod;
    cout<<ans<<'\n';
}
int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    LL T; cin>>T;
    while (T--) solve();
}