Example

Input

0 3 1 7 5 9 8 6 4 2
7 0 9 2 1 5 4 8 6 3
4 2 0 6 8 7 1 3 5 9
1 7 5 0 9 8 3 4 2 6
6 1 2 3 0 4 5 9 7 8
3 6 7 4 2 0 9 5 8 1
5 8 6 9 7 2 0 1 3 4
8 9 4 5 3 6 2 0 1 7
9 4 3 8 6 1 7 2 0 5
2 5 8 1 4 3 6 7 9 0


Output

0
#include<iostream>
#include<string>
using namespace std;
int p[10][10];
int check_digit(int G) {
	if (G < 10000) {
		int a = G / 1000, b = (G / 100) % 10, c = (G / 10) % 10, d = G % 10;
		int F = p[p[p[p[0][a]][b]][c]][d]; return F;
	}
	int a = G / 10000, b = (G / 1000) % 10, c = (G / 100) % 10, d = (G / 10) % 10, e = G % 10;
	int F = p[p[p[p[p[0][a]][b]][c]][d]][e]; return F;
}
int main() {
	int cnt = 0;
	for (int i = 0; i < 100; i++)cin >> p[i / 10][i % 10];
	for (int i = 0; i < 10000; i++) {
		string S = to_string(i); while (S.size() < 4)S = '0' + S;
		S += (char)('0' + check_digit(stoi(S)));
		bool OK = true;
		for (int j = 0; j < 5; j++) {
			for (int k = 0; k < 10; k++) {
				if (S[j] == ('0' + k))continue;
				string T = S; T[j] = '0' + k;
				if (check_digit(stoi(T)) == 0)OK = false;
			}
		}
		for (int j = 0; j < 4; j++) {
			if (S[j] == S[j + 1])continue;
			string T = S; swap(T[j], T[j + 1]);
			if (check_digit(stoi(T)) == 0)OK = false;
		}
		if (OK == false)cnt++;
	}
	cout << cnt << endl;
	return 0;
}