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 <algorithm>
#include <vector>
using namespace std;

int table[10][10];

int calce(int const * const digits) {
  int ta = table[0][digits[0]];
  int tb = table[ta][digits[1]];
  int tc = table[tb][digits[2]];
  int td = table[tc][digits[3]];
  return td;
}

int main(void) {
  for (int i = 0; i < 10; i++)
    for (int j = 0; j < 10; j++)
      cin >> table[i][j];
  
  int digits[5];
  int ans = 0;
  for (int i = 0; i < 10000; i++) {
    digits[0] = i / 1000;
    digits[1] = i % 1000 / 100;
    digits[2] = i % 1000 % 100 / 10;
    digits[3] = i % 10;
    digits[4] = calce(digits);
  
    bool ng = false;
    // wrong case 1
    for (int j = 0; j < 5; j++) {
      for (int k = 0; k < 10; k++) {
        if (k == digits[j]) continue;
        int bk = digits[j];
        digits[j] = k;
  
        int check = table[calce(digits)][digits[4]];
        if (check == 0) ng = true;
  
        digits[j] = bk;
      }
    }
  
    // wrong case 2
    for (int j = 0; j < 4; j++) {
      if (digits[j] == digits[j+1]) continue;

      swap(digits[j], digits[j+1]);
  
      int check = table[calce(digits)][digits[4]];
      if (check == 0) ng = true;
  
      swap(digits[j], digits[j+1]);
    }

    ans += ng;
  }
  
  cout << ans << endl;
  return 0;
}