





"""simple docstring"""





def 					__A  (_SCREAMING_SNAKE_CASE     )   ->tuple[int, int]:





  """simple docstring"""


  try:
    lowerCAmelCase__     :str											=				float(_SCREAMING_SNAKE_CASE     )
  except ValueError:
    raise ValueError('Please enter a valid number'     )
  lowerCAmelCase__     :Optional[int]											=				decimal - int(_SCREAMING_SNAKE_CASE     )
  if fractional_part == 0:
    return int(_SCREAMING_SNAKE_CASE     ), 1
  else:
    lowerCAmelCase__     :List[Any]											=				len(str(_SCREAMING_SNAKE_CASE     ).split('.'     )[1]     )
    lowerCAmelCase__     :List[str]											=				int(decimal * (10**number_of_frac_digits)     )
    lowerCAmelCase__     :List[str]											=				10**number_of_frac_digits
    lowerCAmelCase__				,							lowerCAmelCase__     :Tuple											=				denominator, numerator
    while True:
      lowerCAmelCase__     :Union[str, Any]											=				dividend % divisor
      if remainder == 0:
        break
      lowerCAmelCase__				,							lowerCAmelCase__     :int											=				divisor, remainder
    lowerCAmelCase__				,							lowerCAmelCase__     :Any											=				numerator / divisor, denominator / divisor
    return int(_SCREAMING_SNAKE_CASE     ), int(_SCREAMING_SNAKE_CASE     )


if __name__ == "__main__":
  print(F'''{decimal_to_fraction(2) = }''')
  print(F'''{decimal_to_fraction(89.0) = }''')
  print(F'''{decimal_to_fraction("67") = }''')
  print(F'''{decimal_to_fraction("45.0") = }''')
  print(F'''{decimal_to_fraction(1.5) = }''')
  print(F'''{decimal_to_fraction("6.25") = }''')
  print(F'''{decimal_to_fraction("78td") = }''')







"""simple docstring"""





from __future__ import annotations

import math
def 					__A  (_SCREAMING_SNAKE_CASE     )   ->bool:





  """simple docstring"""


  if 1 < number < 4:
    # 2 and 3 are primes
    return True
  elif number < 2 or number % 2 == 0 or number % 3 == 0:
    # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
    return False

  # All primes number are in format of 6k +/- 1
  for i in range(5	,  int(math.sqrt(_SCREAMING_SNAKE_CASE     ) + 1     )	,  6     ):
    if number % i == 0 or number % (i + 2) == 0:
      return False
  return True


__A											=						[num for num in range(3, 10_0001, 2) if not is_prime(num)]
def 					__A  (_SCREAMING_SNAKE_CASE     )   ->list[int]:





  """simple docstring"""


  if not isinstance(_SCREAMING_SNAKE_CASE	,  _SCREAMING_SNAKE_CASE     ):
    raise ValueError('n must be an integer'     )
  if n <= 0:
    raise ValueError('n must be >= 0'     )

  lowerCAmelCase__     :Tuple											=				[]
  for num in range(len(_SCREAMING_SNAKE_CASE     )     ):
    lowerCAmelCase__     :int											=				0
    while 2 * i * i <= odd_composites[num]:
      lowerCAmelCase__     :int											=				odd_composites[num] - 2 * i * i
      if is_prime(_SCREAMING_SNAKE_CASE     ):
        break
      i += 1
    else:
      list_nums.append(odd_composites[num]     )
      if len(_SCREAMING_SNAKE_CASE     ) == n:
        return list_nums

  return []
def 					__A  ()   ->int:





  """simple docstring"""


  return compute_nums(1     )[0]


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