



def A    (							__UpperCamelCase       )    ->   tuple[int, int]:
			try:
						A__	  =     float(__UpperCamelCase       )
			except ValueError:
						raise ValueError('Please enter a valid number'       )
			A__	  =     decimal - int(__UpperCamelCase       )
			if fractional_part == 0:
						return int(__UpperCamelCase       ), 1
			else:
						A__	  =     len(str(__UpperCamelCase       ).split('.'       )[1]       )
						A__	  =     int(decimal * (10**number_of_frac_digits)       )
						A__	  =     10**number_of_frac_digits
						A__  ,			A__	  =     denominator, numerator
						while True:
									A__	  =     dividend % divisor
									if remainder == 0:
												break
									A__  ,			A__	  =     divisor, remainder
						A__  ,			A__	  =     numerator / divisor, denominator / divisor
						return int(__UpperCamelCase       ), int(__UpperCamelCase       )


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







def 	_snake_case     (							lowercase__						):  # This function is recursive
				_lowerCamelCase	:     Optional[Any]       =       len(lowercase__						)
				# If the array contains only one element, we return it (it's the stop condition of
				# recursion)
				if array_length <= 1:
								return array
								# Else
				_lowerCamelCase	:     Optional[Any]       =       array[0]
				_lowerCamelCase	:     Optional[int]       =       False
				_lowerCamelCase	:     List[str]       =       1
				_lowerCamelCase	:     list[int]       =       []
				while not is_found and i < array_length:
								if array[i] < pivot:
												_lowerCamelCase	:     Union[str, Any]       =       True
												_lowerCamelCase	:     str       =       [element for element in array[i:] if element >= array[i]]
												_lowerCamelCase	:     str       =       longest_subsequence(lowercase__						)
												if len(lowercase__						) > len(lowercase__						):
																_lowerCamelCase	:     Any       =       temp_array
								else:
												i += 1

				_lowerCamelCase	:     Optional[Any]       =       [element for element in array[1:] if element >= pivot]
				_lowerCamelCase	:     Dict       =       [pivot, *longest_subsequence(lowercase__						)]
				if len(lowercase__						) > len(lowercase__						):
								return temp_array
				else:
								return longest_subseq


if __name__ == "__main__":
			import doctest

			doctest.testmod()