






from itertools import count



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      int = 5_0     )    ->   int:





    """simple docstring"""

    __A       =						[1] * min_block_length

    for n in count(__lowercase     ):
        fill_count_functions.append(1     )

        for block_length in range(__lowercase      ,					n + 1     ):
            for block_start in range(n - block_length     ):
                fill_count_functions[n] += fill_count_functions[
                    n - block_start - block_length - 1
                ]

            fill_count_functions[n] += 1

        if fill_count_functions[n] > 1_0_0_0_0_0_0:
            break

    return n


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












from __future__ import annotations



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      list[int]      ,					__lowercase :      int     )    ->   bool:





    """simple docstring"""

    if len(__lowercase     ) == 0:
        return False
    __A       =						len(__lowercase     ) // 2
    if a_list[midpoint] == item:
        return True
    if item < a_list[midpoint]:
        return binary_search(a_list[:midpoint]      ,					__lowercase     )
    else:
        return binary_search(a_list[midpoint + 1 :]      ,					__lowercase     )


if __name__ == "__main__":
  __a   :							Tuple						= input("Enter numbers separated by comma:\n").strip()
  __a   :							Any						= [int(item.strip()) for item in user_input.split(",")]
  __a   :							List[Any]						= int(input("Enter the number to be found in the list:\n").strip())
  __a   :							Optional[int]						= "" if binary_search(sequence, target) else "not "
  print(f"""{target} was {not_str}found in {sequence}""")




