#include // #include // #include using namespace std; // using namespace atcoder; // using bint = boost::multiprecision::cpp_int; using ll = long long; using ull = unsigned long long; using P = pair; using vi = vector; using vvi = vector; using vvvi = vector; #define rep(i,n) for(ll i = 0;i < (ll)n;i++) #define ALL(x) (x).begin(),(x).end() #define sz(c) ((ll)(c).size()) #define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin()) #define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin()) // #define MOD 1000000007 #define MOD 998244353 templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,vector&v){for(int i = 0;i < v.size();i++)os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.first>>p.second;return is;} int main(){ ios_base::sync_with_stdio(0), cin.tie(0); vector a(6); cin >> a; set st; auto dfs = [&](auto &dfs,string &s,int d,bool is)->void{ if(d == 6){ st.insert(stoi(s)); return ; } rep(i,10){ string t = string(6,'0'); rep(j,6){ int k = s[j]-'0'; k += i*(a[d][j]-'0'); k %= 10; t[j] = char('0'+k); } dfs(dfs,t,d+1,is|(i != 0)); } }; string s = string(6,'0'); dfs(dfs,s,0,false); cout << sz(st) << "\n"; return 0; }