import sys

# sys.setrecursionlimit(1000006)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353


def dadd(a,b):
    c=0
    t=1
    while a or b:
        a,x=divmod(a,10)
        b,y=divmod(b,10)
        c+=(x+y)%10*t
        t*=10
    return c

dp=[0]*1000000
st=[]
aa=[]
for _ in range(6):
    a=II()
    if dp[a]:continue
    dp[a]=1
    st.append(a)
    aa.append(a)

while st:
    u=st.pop()
    for a in aa:
        b=dadd(u,a)
        if dp[b]:continue
        dp[b]=1
        st.append(b)

print(sum(dp))