




from __future__ import annotations

from collections.abc import Generator




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						Generator[int, None, None]:

    """simple docstring"""


    if not isinstance(lowercase_       ,  lowercase_   ) or n < 1:
        raise Exception('''Sequence only defined for positive integers'''   )

    yield n
    while n != 1:
        if n % 2 == 0:
            n //= 2
        else:
            __UpperCamelCase			=    3 * n + 1
        yield n




def        __SCREAMING_SNAKE_CASE (	)							->						Any:

    """simple docstring"""


    __UpperCamelCase			=    43
    __UpperCamelCase			=    tuple(collatz_sequence(lowercase_   )   )
    print(lowercase_   )
    print(F"Collatz sequence from {n} took {len(lowercase_   )} steps."   )


if __name__ == "__main__":
 main()














"""simple docstring"""


_UpperCamelCase							:       str       					=		10**8




def      snake_case    (A_ :int ):







  '''simple docstring'''

  if n % 1_0 == 0:
    return False
  a	:     Optional[int]							=  str(A_ )
  return s == s[::-1]




def      snake_case    ():







  '''simple docstring'''

  a	:     Tuple							=  set()
  a	:     Optional[Any]							=  1
  a	:     List[str]							=  5
  while sum_squares < LIMIT:
    a	:     int							=  first_square + 1
    while sum_squares < LIMIT:
      if is_palindrome(A_ ):
        answer.add(A_ )
      last_square += 1
      sum_squares += last_square**2
    first_square += 1
    a	:     List[str]							=  first_square**2 + (first_square + 1) ** 2

  return sum(A_ )


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




