#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

int a,b,c,d,e;
template<class Type>
Type solve(Type res = Type()){
    auto x = make_v<int>(10,10);
    for(auto& vec:x) for(auto& in:vec) cin >> in;

    auto mendoudayo = [&]{
        return x[x[x[x[0][a]][b]][c]][d];
    };
    auto mendoudayooooo = [&](int v1,int v2,int v3,int v4,int v5){
        return x[x[x[x[x[0][v1]][v2]][v3]][v4]][v5];
    };
    
    auto mendouna_cheeeeeek = [&]{
        bool ret = false;
        for(int i = 0; i < 10;i++){
            if(i == a) continue;
            if(mendoudayooooo(i,b,c,d,e) == 0) ret = true;
        }
        for(int i = 0; i < 10;i++){
            if(i == b) continue;
            if(mendoudayooooo(a,i,c,d,e) == 0) ret = true;
        }
        for(int i = 0; i < 10;i++){
            if(i == c) continue;
            if(mendoudayooooo(a,b,i,d,e) == 0) ret = true;
        }
        for(int i = 0; i < 10;i++){
            if(i == d) continue;
            if(mendoudayooooo(a,b,c,i,e) == 0) ret = true;
        }
        for(int i = 0; i < 10;i++){
            if(i == e) continue;
            if(mendoudayooooo(a,b,c,d,i) == 0) ret = true;
        }
        if(a != b && mendoudayooooo(b,a,c,d,e) == 0) ret = true;
        if(b != c && mendoudayooooo(a,c,b,d,e) == 0) ret = true;
        if(c != d && mendoudayooooo(a,b,d,c,e) == 0) ret = true;
        if(d != e && mendoudayooooo(a,b,c,e,d) == 0) ret = true;

        return ret;
    };
    for(a = 0; a < 10; a++){
        for(b = 0; b < 10; b++){
            for(c = 0; c < 10; c++){
                for(d = 0; d < 10; d++){
                    e = mendoudayo();
                    res += mendouna_cheeeeeek();
                }
            }
        }
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    // solve(0);
    cout << fixed << setprecision(15) << solve<ll>() << endl;
    return 0;
}



Measured memory_bytes: 3216