#include <iostream>
#include <vector>

using namespace std;

const int MOD = 1e9 + 7;
const int MAXN = 500005;

long long fact[MAXN], inv[MAXN];

long long power(long long base, long long exp) {
    long long res = 1;
    base %= MOD;
    while (exp > 0) {
        if (exp % 2 == 1) res = (res * base) % MOD;
        base = (base * base) % MOD;
        exp /= 2;
    }
    return res;
}

long long modInverse(long long n) {
    return power(n, MOD - 2);
}

void precompute() {
    fact[0] = 1;
    inv[0] = 1;
    for (int i = 1; i < MAXN; i++) {
        fact[i] = (fact[i - 1] * i) % MOD;
    }
    inv[MAXN - 1] = modInverse(fact[MAXN - 1]);
    for (int i = MAXN - 2; i >= 1; i--) {
        inv[i] = (inv[i + 1] * (i + 1)) % MOD;
    }
}

long long nCr(int n, int r) {
    if (r < 0 || r > n) return 0;
    return fact[n] * inv[r] % MOD * inv[n - r] % MOD;
}

long long solve(int L, int R, const vector<long long>& a) {
    if (L > R) return 1;
    
    int m = -1;
    for (int i = 0; L + i <= R - i; ++i) {
        if (a[L + i] == 1LL * (i + 1) * (R - (L + i) + 1)) {
            m = L + i;
            break;
        }
        if (a[R - i] == 1LL * (R - i - L + 1) * (i + 1)) {
            m = R - i;
            break;
        }
    }
    
    if (m == -1) return 0;

    long long left_ways = solve(L, m - 1, a);
    if (left_ways == 0) return 0; 
    
    long long right_ways = solve(m + 1, R, a);
    if (right_ways == 0) return 0; 

    long long ways = (left_ways * right_ways) % MOD;
    ways = (ways * nCr(R - L, m - L)) % MOD;
    
    return ways;
}

void run_case() {
    int n;
    cin >> n;
    vector<long long> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    cout << solve(1, n, a) << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    precompute();
    
    int t;
    cin >> t;
    while (t--) {
        run_case();
    }
    
    return 0;
}