





'''simple docstring'''







from itertools import product





def 							lowerCamelCase_   (	SCREAMING_SNAKE_CASE__   :      int = 15 )			->						int:
						UpperCAmelCase_      :   float      =	0.0
						UpperCAmelCase_      :   float
						UpperCAmelCase_      :   int
						UpperCAmelCase_      :   int
						UpperCAmelCase_      :   int
						UpperCAmelCase_      :   int
						UpperCAmelCase_      :   tuple[int, ...]

						for series in product(range(2 ),      repeat=SCREAMING_SNAKE_CASE__ ):
												UpperCAmelCase_      :   str      =	series.count(1 )
												UpperCAmelCase_      :   Dict      =	num_turns - num_blue
												if num_red >= num_blue:
																		continue
												UpperCAmelCase_      :   int      =	1.0
												for ind, col in enumerate(SCREAMING_SNAKE_CASE__,      2 ):
																		if col == 0:
																								prob *= (ind - 1) / ind
																		else:
																								prob *= 1 / ind

												total_prob += prob

						return int(1 / total_prob )


if __name__ == "__main__":
					print(f'''{solution() = }''')






'''simple docstring'''




__snake_case  : str		       =    10**8





def 	_UpperCAmelCase       (				_UpperCamelCase       :      int  )      -> bool:
    if n % 10 == 0:
        return False
    A_      =  str(_UpperCamelCase  )
    return s == s[::-1]





def 	_UpperCAmelCase       (				)      -> int:
    A_      =  set()
    A_      =  1
    A_      =  5
    while sum_squares < LIMIT:
        A_      =  first_square + 1
        while sum_squares < LIMIT:
            if is_palindrome(_UpperCamelCase  ):
                answer.add(_UpperCamelCase  )
            last_square += 1
            sum_squares += last_square**2
        first_square += 1
        A_      =  first_square**2 + (first_square + 1) ** 2

    return sum(_UpperCamelCase  )


if __name__ == "__main__":
  print(solution())






