#include <bits/stdc++.h>


using namespace std;
typedef long long ll;

const int N = 5e3 + 2, MOD = (int)1e9 + 7;

int n, h[N], k;

void add(int &x, int y) {
    x += y;
    if(x >= MOD) x -= MOD;
}
int dp[N];
map<pair<int, int> , int> pd[N];
void make() {
    for(int i = 1; i <= n; i++) {
        int l, r, f;
        l = r = h[i];
        f = i;
        for(int j = i + 1; j <= n; j++) {
            if(h[j] < h[f]) {
                if(abs(l - h[j]) <= 1 && abs(r - h[j]) <= 1) {
                    f = j;
                }
            }
            l = min(l, h[j]);
            r = max(r, h[j]);
        }
        while(f != i) {
            swap(h[f], h[f - 1]);
            --f;
        }
    }
}
int cl[N];
void test() {
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> h[i];
        if(h[i] == h[i - 1]) {
            cl[i] = cl[i - 1] + 1;
        } else {
            cl[i] = 1;
        }
    }
    make();
    for(int i = 1; i <= n; i++) {
        pd[i].clear();
    }
    dp[0] = 1;
    for(int i = 1; i <= n; i++) {
        if(i == 1) pd[i][{1, h[i]}] = dp[i - 1];
        else {
            for(int j = h[i - 1] - 1; j <= h[i - 1] + 1; j++) {
                if(j != h[i]) {
                    for(int f = 1; f <= i; f++) {
                        add(pd[i][{1, h[i]}], pd[i - 1][{f, j}]);
                    }
                }
            }
        }
        int s = 0, s1 = 0;
        for(int j = i; j >= 1; j--) {
            int val = pd[i - 1][{j, h[i] - 1}], val1 = pd[i - 1][{j, h[i] + 1}];
            if(h[i - 1] == h[i] - 1 && cl[i - 1] >= j) {
                for(int f = 1; f <= i; f++) {
                    add(s, pd[i - 1 - j][{f, h[i] + 1}] * 1ll * f % MOD);
                }
            }
            if(h[i - 1] == h[i] + 1 && cl[i - 1] >= j) {
                for(int f = 1; f <= i; f++) {
                    add(s1, pd[i - 1 - j][{f, h[i] - 1}] * 1ll * f % MOD);
                }
            }
            add(s, val);
            add(s1, val1);

            pd[i][{j, h[i] - 1}] = s;
            pd[i][{j, h[i] + 1}] = s1;
            if(j > 1) {
                pd[i][{j, h[i]}] = pd[i - 1][{j - 1, h[i]}];
            }
        }
        int j = i - 1;
        dp[i] = dp[i - 1];
        for(; j >= 1 && abs(h[j] - h[i]) == 1; j--) {
            add(dp[i], dp[j - 1]);
        }
        for(int f = 1; f <= i; f++) {
            add(dp[i], f * 1ll * pd[j][{f, h[i] - 1}] % MOD);
            add(dp[i], f * 1ll * pd[j][{f, h[i] + 1}] % MOD);
        }
    }
    cout << dp[n] << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    cin >> t;

    while(t--) {
        test();
    }
}