


'''simple docstring'''






from __future__ import annotations


def 					_snake_case   (     A       )						->    list[int]:
							lowerCAmelCase__          =	[0] * max_one

							for i in range(0 ,    A       ):
														lowerCAmelCase__          =	i

							for i in range(2 ,    A       ):
														if totients[i] == i:
																					for j in range(A ,    A ,    A       ):
																												totients[j] -= totients[j] // i

							return totients


def 					_snake_case   (     A ,    A       )						->    bool:
							return sorted(str(A       )       ) == sorted(str(A       )       )


def 					_snake_case   (     A = 10000000       )						->    int:
							lowerCAmelCase__          =	1  # i
							lowerCAmelCase__          =	0  # φ(i)
							lowerCAmelCase__          =	get_totients(max_n + 1       )

							for i in range(2 ,    max_n + 1       ):
														lowerCAmelCase__          =	totients[i]

														if i * min_denominator < min_numerator * t and has_same_digits(A ,    A       ):
																					lowerCAmelCase__          =	i
																					lowerCAmelCase__          =	t

							return min_numerator


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



'''simple docstring'''






def 					_snake_case   (     A ,    A       )						->    float:
							return a + b


if __name__ == "__main__":
		__UpperCAmelCase    				=							5
		__UpperCAmelCase    				=							6
		print(f"""The sum of {a} + {b} is {add(a, b)}""")