#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  vector<vector<ll>> a;
  {
    set<string> st;
    rep(i, 6) {
      string s;
      cin >> s;
      st.insert(s);
    }
    vector<string> vec(st.begin(), st.end());
    set<string> st2;
    rep(j, 6) {
      string s = ""s;
      rep(i, vec.size()) { s.push_back(vec[i][j]); }
      st2.insert(s);
    }
    vector<string> vec2(st2.begin(), st2.end());
    a.resize(vec.size());
    rep(i, vec.size()) {
      rep(j, vec2.size()) { a[i].push_back(vec2[j][i] - '0'); }
    }
  }
  ll ans = 1;
  rep(j, a[0].size()) {
    bool ok = false, ff = false, ef = false;
    rep(i, a.size()) {
      ok |= a[i][j] != 5 && a[i][j] % 2 == 1;
      ff |= a[i][j] == 5;
      ef |= a[i][j] != 0 && a[i][j] % 2 == 0;
    }
    if (ok || (ff && ef)) {
      ans *= 10;
    } else if (ff) {
      ans *= 2;
    } else if (ef) {
      ans *= 5;
    }
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}