// from 2745518585
// Ad: Orita: Useful OI Tools: https://github.com/2745518585/Orita
#include <bits/stdc++.h>
using namespace std;
const int N = 101;
int n, a[N][11], b[11];
bool check() {
    for (int i = 1; i <= n; ++i) {
        int x = 0;
        for (int j = 1; j <= 5; ++j) {
            if (a[i][j] != b[j]) {
                if (x == 0)
                    x = j;
                else if (x == j - 1) {
                    if ((a[i][j] - b[j] + 10) % 10 != (a[i][j - 1] - b[j - 1] + 10) % 10)
                        return false;
                } else
                    return false;
            }
        }
        if (x == 0)
            return false;
    }
    return true;
}
int main() {
    freopen("lock.in", "r", stdin);
    freopen("lock.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= 5; ++j) {
            scanf("%d", &a[i][j]);
        }
    }
    int s = 0;
    for (b[1] = 0; b[1] <= 9; ++b[1])
        for (b[2] = 0; b[2] <= 9; ++b[2])
            for (b[3] = 0; b[3] <= 9; ++b[3])
                for (b[4] = 0; b[4] <= 9; ++b[4])
                    for (b[5] = 0; b[5] <= 9; ++b[5]) s += check();
    printf("%d", s);
    return 0;
}