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 <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>

using namespace std;
#define int long long int
const int INF = 1001001001001001LL;
const int MOD = 1000000007;
int table[10][10];

int check(int a, int b, int c, int d, int e){
    int ret = 0;
    ret = table[ret][a];
    ret = table[ret][b];
    ret = table[ret][c];
    ret = table[ret][d];
    ret = table[ret][e];
    return ret;
}

int f(int a, int b, int c, int d, int e){
    int ret = 0;

    // 桁を入れ替える
    for(int i = 0; i < 10; i++) if(i != a) if(check(i, b, c, d, e) == 0) return -1;
    for(int i = 0; i < 10; i++) if(i != b) if(check(a, i, c, d, e) == 0) return -1;
    for(int i = 0; i < 10; i++) if(i != c) if(check(a, b, i, d, e) == 0) return -1;
    for(int i = 0; i < 10; i++) if(i != d) if(check(a, b, c, i, e) == 0) return -1;
    for(int i = 0; i < 10; i++) if(i != e) if(check(a, b, c, d, i) == 0) return -1;

    if(a != b) if(check(b, a, c, d, e) == 0) return -1;
    if(b != c) if(check(a, c, b, d, e) == 0) return -1;
    if(c != d) if(check(a, b, d, c, e) == 0) return -1;
    if(d != e) if(check(a, b, c, e, d) == 0) return -1;
    return 0;
}

signed main(){
    
    for(int i = 0; i < 10; i++) for(int j = 0; j < 10; j++) cin >> table[i][j];

    int ans = 0;
    for(int a = 0; a < 10; a++) for(int b = 0; b < 10; b++) for(int c = 0; c < 10; c++) for(int d = 0; d < 10; d++)
    {
        int e = table[0][a];
        e = table[e][b];
        e = table[e][c];
        e = table[e][d];
        
        if(f(a, b, c, d, e) == -1) ans++;

    }
    
    cout << ans << endl;

    return 0;
}


