
from __future__ import annotations

from fractions import Fraction


def 						UpperCAmelCase			(	a_		,   a_						)		->	bool:







				"""simple docstring"""



				return (
				    num != den and num % 1_0 == den // 1_0 and (num // 1_0) / (den % 1_0) == num / den
				)


def 						UpperCAmelCase			(	a_						)		->	list[str]:







				"""simple docstring"""



				__A   			= []
				__A   			= 1_1
				__A   			= int("1" + "0" * digit_len						)
				for num in range(a_		,   a_						):
								while den <= 9_9:
												if (num != den) and (num % 1_0 == den // 1_0) and (den % 1_0 != 0):
																if is_digit_cancelling(a_		,   a_						):
																				solutions.append(F'''{num}/{den}'''						)
												den += 1
								num += 1
								__A   			= 1_0
				return solutions


def 						UpperCAmelCase			(	a_ = 2						)		->	int:







				"""simple docstring"""



				__A   			= 1.0
				for fraction in fraction_list(a_						):
								__A   			= Fraction(a_						)
								result *= frac.denominator / frac.numerator
				return int(a_						)


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






from __future__ import annotations

from collections.abc import Iterator

class 		__lowerCAmelCase	:
							def __init__(						self						:Optional[Any]		,      __magic_name__						:int				):







								'''simple docstring'''







								a										=							value
								a										=							None
								a										=							None







class 		__lowerCAmelCase	:
							def __init__(						self						:str		,      __magic_name__						:Node				):







								'''simple docstring'''







								a										=							tree
							def       lowerCamelCase__							(						self						:str		,      __magic_name__						:Node | None				):







								'''simple docstring'''







								if node is None:
									return 0
								return node.value + (
								    self.depth_first_search(node.left				) + self.depth_first_search(node.right				)
								)





							def __iter__(						self						:Tuple				):







								'''simple docstring'''







								yield self.depth_first_search(self.tree				)


if __name__ == "__main__":
		import doctest

		doctest.testmod()

