from __future__ import annotations


def SCREAMING_SNAKE_CASE			(       lowercase_:		int			):
       _UpperCamelCase       :    List[str]					  =					[0] * max_one

       for i in range(0						,  lowercase_			):
              _UpperCamelCase       :    int					  =					i

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

       return totients


def SCREAMING_SNAKE_CASE			(       lowercase_:		int						,  lowercase_:		int			):
       return sorted(str(lowercase_			)			) == sorted(str(lowercase_			)			)


def SCREAMING_SNAKE_CASE			(       lowercase_:		int = 10000000			):
       _UpperCamelCase       :    Optional[int]					  =					1  # i
       _UpperCamelCase       :    Optional[int]					  =					0  # φ(i)
       _UpperCamelCase       :    Union[str, Any]					  =					get_totients(max_n + 1			)

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

              if i * min_denominator < min_numerator * t and has_same_digits(lowercase_						,  lowercase_			):
                     _UpperCamelCase       :    Any					  =					i
                     _UpperCamelCase       :    List[Any]					  =					t

       return min_numerator


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




def SCREAMING_SNAKE_CASE			(       lowercase_:		int = 4000000			):
       _UpperCamelCase       :    str					  =					1
       _UpperCamelCase       :    str					  =					2
       _UpperCamelCase       :    Tuple					  =					0
       while j <= n:
              if j % 2 == 0:
                     total += j
              _UpperCamelCase  , _UpperCamelCase       :    int					  =					j, i + j

       return total


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



