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 <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}

const ll n = 10;
vector<vector<ll>> A(n, vector<ll>(n));
ll f(ll a, ll b) {
    return A[a][b];
}
ll f(const vector<ll>& v) {
    ll res = 0;
    rep(i, 0, v.size()) {
        res = f(res, v[i]);
    }
    return res;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> A;
    ll ans = 0;
    rep(i, 10000) {
        vector<ll> v(4);
        ll k = i;
        rep(j, 4) {
            v[3-j] = k % 10;
            k /= 10;
        }
        v.pb(f(v));
        assert(f(v) == 0);
        try {
            rep(j, 5) rep(k, 10) {
                if (v[j] == k) continue;
                vector<ll> nv = v;
                nv[j] = k;
                if (f(nv) == 0) throw 1;
            }
            rep(j, 4) {
                if (v[j] == v[j+1]) continue;
                vector<ll> nv = v;
                swap(nv[j], nv[j+1]);
                if (f(nv) == 0) {
                    // cout << v << endl;
                    // cout << nv << endl;
                    // cout << endl;
                    throw 1;
                }
            }
        }
        catch (int err) {
            ++ans;
        }
    }
    cout << ans << endl;
}