from itertools import combinations

def is_cpctf_like(s):
    # s: 文字列 長さ5
    return (
        s[0] == s[2] and
        s[1] != s[0] and
        s[3] != s[0] and
        s[4] != s[0] and
        len({s[1], s[3], s[4]}) == 3
    )

def count_cpctf_like_subsequences(S):
    N = len(S)
    count = 0
    for indices in combinations(range(N), 5):
        sub = ''.join(S[i] for i in indices)
        if is_cpctf_like(sub):
            count += 1
    return count

# 例:
S = input().strip()
print(count_cpctf_like_subsequences(S))