from collections import deque

def count_distinct_strings(S):
    visited = set()
    queue = deque([S])
    visited.add(S)
    n = len(S)
    
    while queue:
        current = queue.popleft()
        # Generate all possible pairs of non-overlapping substrings t and u
        for l_t in range(n):
            for r_t in range(l_t, n):
                cnt0_t = current[l_t:r_t+1].count('0')
                cnt1_t = (r_t - l_t + 1) - cnt0_t
                # Look for u after t
                for l_u in range(r_t + 1, n):
                    for r_u in range(l_u, n):
                        cnt0_u = current[l_u:r_u+1].count('0')
                        cnt1_u = (r_u - l_u + 1) - cnt0_u
                        if cnt0_t == cnt0_u and cnt1_t == cnt1_u:
                            # Swap t and u
                            # Extract the parts
                            before_t = current[:l_t]
                            t = current[l_t:r_t+1]
                            between = current[r_t+1:l_u]
                            u = current[l_u:r_u+1]
                            after_u = current[r_u+1:]
                            # Construct new string
                            new_str = before_t + u + between + t + after_u
                            if new_str not in visited:
                                visited.add(new_str)
                                queue.append(new_str)
    return len(visited)

S = input().strip()
print(count_distinct_strings(S))