from collections import deque

def bfs_digits(init_digits):
    seen = set(init_digits)
    queue = deque(init_digits)
    
    while queue:
        cur = queue.popleft()
        for d in seen.copy():  
            new_digit = (cur + d) % 10
            if new_digit not in seen:
                seen.add(new_digit)
                queue.append(new_digit)
                if len(seen) == 10:
                    return seen
    return seen
original_nums = [input().strip() for _ in range(6)]
digit_pos = [[int(num[i]) for num in original_nums] for i in range(6)]
result = 1

for digits in digit_pos:
    unique_digits = bfs_digits(digits)
    result *= len(unique_digits)

print(result)