#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int f(int X, int Y) {
    int ret = 0, ten = 1;
    for (int i = 0; i < 6; i++) {
        int x = X % 10, y = Y % 10;
        ret += ten * ((x + y) % 10);
        X /= 10;
        Y /= 10;
        ten *= 10;
    }

    return ret;
}

int main() {
    int N = 6;
    vector<string> S(N);
    for (int i = 0; i < N; i++) {
        cin >> S[i];
    }

    const int MX = 1e6;

    vector<bool> dp(MX, false);
    for (int i = 0; i < N; i++) {
        dp[stoi(S[i])] = true;
    }

    for (int i = 0; i < N; i++) {
        set<int> st;
        for (int j = 0; j < MX; j++) {
            if (dp[j]) {
                st.insert(j);
            }
        }
        int x = stoi(S[i]);
        if (x == 0) {
            continue;
        }

        for (int j = 0; j < MX; j++) {
            if (st.count(j)) {
                int now = j;
                while (!st.count(f(now, x))) {
                    now = f(now, x);
                    st.insert(now);
                }
            }
        }

        for (int x : st) {
            dp[x] = true;
        }
    }

    int ans = 0;
    for (int i = 0; i < MX; i++) {
        if (dp[i]) {
            ans++;
        }
    }

    cout << ans << endl;
}