// yukicoder My Practice
// author: Leonardone @ NEETSDKASU

#include <iostream>

using namespace std;

int isKadomatsuRetsu(int a1, int a2, int a3) {
    return a1 != a3 && ((a2 > a1 && a2 > a3) || (a2 < a1 && a2 < a3));
}

int checkNotKadomatsuRetsu(int a1, int a2, int a3) {
    if (a1 > 0 && a2 > 0 && a1 == a2) return !0;
    if (a1 > 0 && a3 > 0 && a1 == a3) return !0;
    if (a2 > 0 && a3 > 0 && a2 == a3) return !0;
    if (a1 * a2 * a3 == 0) return 0;
    return !isKadomatsuRetsu(a1, a2, a3);
}

int checkNotKadomatuGyoretsu(int a[3][3]) {
    if (checkNotKadomatsuRetsu(a[0][0], a[0][1], a[0][2])) return 1;
    if (checkNotKadomatsuRetsu(a[1][0], a[1][1], a[1][2])) return 1;
    if (checkNotKadomatsuRetsu(a[2][0], a[2][1], a[2][2])) return 1;
    if (checkNotKadomatsuRetsu(a[0][0], a[1][0], a[2][0])) return 1;
    if (checkNotKadomatsuRetsu(a[0][1], a[1][1], a[2][1])) return 1;
    if (checkNotKadomatsuRetsu(a[0][2], a[1][2], a[2][2])) return 1;
    if (checkNotKadomatsuRetsu(a[0][0], a[1][1], a[2][2])) return 1;
    if (checkNotKadomatsuRetsu(a[0][2], a[1][1], a[2][0])) return 1;
    return 0;
}

int isKadomatsuGyoretsu(int a[3][3]) {
    if (!isKadomatsuRetsu(a[0][0], a[0][1], a[0][2])) return 0;
    if (!isKadomatsuRetsu(a[1][0], a[1][1], a[1][2])) return 0;
    if (!isKadomatsuRetsu(a[2][0], a[2][1], a[2][2])) return 0;
    if (!isKadomatsuRetsu(a[0][0], a[1][0], a[2][0])) return 0;
    if (!isKadomatsuRetsu(a[0][1], a[1][1], a[2][1])) return 0;
    if (!isKadomatsuRetsu(a[0][2], a[1][2], a[2][2])) return 0;
    if (!isKadomatsuRetsu(a[0][0], a[1][1], a[2][2])) return 0;
    if (!isKadomatsuRetsu(a[0][2], a[1][1], a[2][0])) return 0;
    return !0;
}


int main() {
    
    int t;
    
    cin >> t;
    
    for (int i = 0; i < t; i++) {
        int l, k;
        int a[3][3];
        int xy[2][2];
        
        k = 0;
        cin >> l;
        for (int y = 0; y < 3; y++)
            for (int x = 0; x < 3; x++) {
                cin >> a[y][x];
                if (a[y][x] == 0) {
                    xy[k][0] = y;
                    xy[k][1] = x;
                    k++;
                }
            }
        
        if (checkNotKadomatuGyoretsu(a)) {
            cout << "0" << endl;
            continue;
        }
        
        int ans = 0;
        int i1 = xy[0][0], j1 = xy[0][1];
        int i2 = xy[1][0], j2 = xy[1][1];
        
        for (int j = l - 1; j > 0; j--) {
            a[i1][j1] = j;
            a[i2][j2] = l - j;
            if (isKadomatsuGyoretsu(a)) ans++;
        }
        
        cout << ans << endl;
    }
    
    return 0;
}