#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        vector<string> a(6);
        queue<string> q;
        constexpr int V = 1e6;
        vector<int> vis(V);

        for (int i = 0; i < 6; i++) {
            cin >> a[i];
            q.push(a[i]);
            vis[stoi(a[i])] = true;
        }

        auto add = [&](string x, string y) {
            string res;
            for (int i = 0; i < 6; i++) {
                res += '0' + (x[i] - '0' + y[i] - '0') % 10;
            }
            return res;
        };

        while (!q.empty()) {
            auto x = q.front();
            q.pop();

            for (auto y : a) {
                auto z = add(x, y);
                if (!vis[stoi(z)]) {
                    vis[stoi(z)] = true;
                    q.push(z);
                }
            }
        }

        int ans = count(vis.begin(), vis.end(), true);
        cout << ans << '\n';
    };
    
    solve();
    
    return 0;
}