#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<vector<int>>a;
	rep(i, 6) {
		string s; cin >> s;
		vector<int>tmp(6);
		rep(i, 6)tmp[i] = s[i] - '0';
		a.push_back(tmp);
	}
	vector<bool>chk(1000000);
	vector<int>now(6);
	auto dfs = [&](auto &&self, int deep)->void {
		if (deep == 6) {
			int val = 0;
			rep(i, 6) val = val * 10 + now[i] % 10;
			chk[val] = true;
			return;
		}
		rep(i, 10) {
			rep(j, 6) now[j] += a[deep][j] * i;
			self(self, deep + 1);
			rep(j, 6) now[j] -= a[deep][j] * i;
		}
	};
	dfs(dfs, 0);
	int ans = 0;
	rep(i, chk.size())if (chk[i])ans++;
	cout << ans << endl;
	return 0;
}