import bisect
import sys
from math import isqrt
from typing import List, Tuple

sys.setrecursionlimit(10 ** 6)

MOD = 998244353

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    x = input()
    y = input()
    z = input()
    s = []
    for i in range(len(x)):
        for j in range(len(y)):
            for k in range(len(z)):
                a, b, c = x[:1 + i], y[:1 + j], z[:1 + k]
                s.extend([a + b + c, a + c + b, b + a + c, b + c + a, c + a + b, c + b + a])
    return len(set(s))


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()