#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int dp[1000000];
int A[6];

int add(int a,int b) {
	int ret=0;
	int i,p10=1;
	FOR(i,6) {
		int x=a%10;
		int y=b%10;
		ret+=(x+y)%10*p10;
		p10*=10;
		a/=10;
		b/=10;
	}
	return ret;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	queue<int> Q;
	FOR(i,6) {
		cin>>A[i];
		dp[A[i]]=1;
		Q.push(A[i]);
	}
	while(Q.size()) {
		y=Q.front();
		Q.pop();
		FOR(i,6) {
			k=add(y,A[i]);
			if(dp[k]==0) {
				dp[k]=1;
				Q.push(k);
			}
		}
	}
	cout<<count(dp,dp+1000000,1)<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}