// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 5005, P = 1e9 + 7;

int n, a[N], b[2][N], t[2], L[N], R[N], pos[N], f[N][N];
 
void inline clr() {
    for (int i = 0; i <= t[0]; i++) {
        for (int j = 0; j <= t[1]; j++) {
            f[i][j] = 0;
        }
    }
    t[0] = t[1] = 0;
}


void inline add(int &x, int y) {
    x += y;
    if (x >= P) x -= P;
}

int main() {
    int T; read(T);
    while (T--) {
        read(n);
        for (int i = 1; i <= n; i++) read(a[i]);
        for (int i = 1; i <= n; i++) {
            int v = a[i] & 1;
            b[v][++t[v]] = i;
            pos[i] = t[v];
        }
        
        for (int i = 1; i <= n; i++) {
            int v = a[i] & 1;
            L[i] = 0, R[i] = n + 1;
            for (int j = 1; j <= t[!v]; j++) {
                if (b[!v][j] < i && abs(a[b[!v][j]] - a[i]) != 1)
                    L[i] = pos[b[!v][j]];
            }
            for (int j = 1; j <= t[!v]; j++) {
                if (b[!v][j] > i && abs(a[b[!v][j]] - a[i]) != 1) {
                    R[i] = pos[b[!v][j]];
                    break;
                }
            }
        }

        f[0][0] = 1;
        for (int i = 0; i <= t[0]; i++) {
            for (int j = 0; j <= t[1]; j++) {
                if (i < t[0]) {
                    int now = b[0][i + 1];
                    if (j < R[now] && j >= L[now]) add(f[i + 1][j], f[i][j]);
                }   
                if (j < t[1]) {
                    int now = b[1][j + 1];
                    if (i < R[now] && i >= L[now]) add(f[i][j + 1], f[i][j]);
                }
            }
        }
        printf("%d\n", f[t[0]][t[1]]);
        clr();
    }
    return 0;
}