def generalized_period(s):
    return set(s)

def minimal_proper_substrings(s, gen_period):
    n = len(s)
    minimal_substrings = set()
    
    for i in range(n):
        for j in range(i + 1, n + 1):
            if j - i < n:  # ensure proper substring
                substr = s[i:j]
                if set(substr) == gen_period:
                    minimal_substrings.add(substr)
    
    # filter out non-minimal substrings
    minimal_proper_substrings = set()
    for substr in minimal_substrings:
        is_minimal = True
        for k in range(1, len(substr)):
            if set(substr[:k]) == gen_period or set(substr[k:]) == gen_period:
                is_minimal = False
                break
        if is_minimal:
            minimal_proper_substrings.add(substr)
    
    return minimal_proper_substrings

def count_minimal_unique_proper_substrings(s):
    gen_period = generalized_period(s)
    minimal_substrings = minimal_proper_substrings(s, gen_period)
    return len(minimal_substrings)

import sys
input = sys.stdin.read
data = input().splitlines()

for line in data:
    if line.strip():
        result = count_minimal_unique_proper_substrings(line)
        print(result)