from collections import deque

def count_possible_strings(S):
    visited = set()
    queue = deque([S])
    visited.add(S)
    n = len(S)
    
    while queue:
        current = queue.popleft()
        # Generate all possible valid swaps
        swaps = []
        # Find all possible t and u
        for t_start in range(n):
            for t_end in range(t_start, n):
                t = current[t_start:t_end+1]
                t0 = t.count('0')
                t1 = t.count('1')
                # Find u after t
                for u_start in range(t_end + 1, n):
                    for u_end in range(u_start, n):
                        u = current[u_start:u_end+1]
                        u0 = u.count('0')
                        u1 = u.count('1')
                        if t0 == u0 and t1 == u1:
                            # Perform swap
                            new_str = current[:t_start] + u + current[t_end+1:u_start] + t + current[u_end+1:]
                            swaps.append(new_str)
        # Check each generated swap
        for s in swaps:
            if s not in visited:
                visited.add(s)
                queue.append(s)
    return len(visited)

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