1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
#include <bits/stdc++.h>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<vi> vvi;
typedef vector<bool> vb;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define loop(i,a,b) for (int (i) = (a); (i) < b; (i)++)
#define rloop(i,a,b) for (int (i) = (a); (i) >= b; (i)--)

int dlan1(int maska)
{
    switch (maska)
    {
    case 0:
        return 1;
        break;
    case 1:
        return 1;
        break;
    case 5:
        return 2;
        break;
    case 6:
        return 1;
        break;
    case 10:
        return 1;
        break;
    default:
        return 0;
        break;
    }
}

int dlan2(int maska)
{
    switch (maska)
    {
    case 0:
        return 540;
        break;
    case 1:
        return 54;
        break;
    case 16:
        return 54;
        break;
    case 17:
        return 24;
        break;
    case 21:
        return 114;
        break;
    case 81:
        return 114;
        break;
    case 85:
        return 720;
        break;
    case 86:
        return 114;
        break;
    case 101:
        return 114;
        break;
    case 102:
        return 24;
        break;
    case 106:
        return 54;
        break;
    case 166:
        return 54;
        break;
    case 170:
        return 540;
        break;
    default:
        return 0;
        break;
    }
}
void solve()
{
    int n, kod= 0, a;
    cin >> n;
    loop(i, 0, 2 * n)
    {
        cin >> a;
        kod |= (a << (i*2));
    }
    if (n == 1)
        cout << dlan1(kod) << '\n';
    if (n == 2)
        cout << dlan2(kod) << '\n';
    else
        cout << 0 << '\n';
}
int main()
{
    cin.tie(0)->sync_with_stdio(false);

    int t;
    cin >> t;
    while (t--) solve();
    return 0;
}