


from itertools import permutations




def 			UpperCamelCase			(					)    ->							Any:
     '''simple docstring'''





     lowercase_				:Dict       			=				list(map(''''''.join				,						permutations('''0123456789'''						)						)						)
     return result[9_9_9_9_9_9]


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








from __future__ import annotations

import math
import random






def  SCREAMING_SNAKE_CASE__							(				UpperCamelCase__:							int    ,      UpperCamelCase__:							int    ,      UpperCamelCase__:							int			):
		SCREAMING_SNAKE_CASE__								=					d * e - 1
		SCREAMING_SNAKE_CASE__								=					0
		SCREAMING_SNAKE_CASE__								=					0
		while p == 0:
				SCREAMING_SNAKE_CASE__								=					random.randint(2    ,      n - 1			)
				SCREAMING_SNAKE_CASE__								=					k
				while True:
						if t % 2 == 0:
								SCREAMING_SNAKE_CASE__								=					t // 2
								SCREAMING_SNAKE_CASE__								=					(g**t) % n
								SCREAMING_SNAKE_CASE__								=					math.gcd(x - 1    ,      UpperCamelCase__			)
								if x > 1 and y > 1:
										SCREAMING_SNAKE_CASE__								=					y
										SCREAMING_SNAKE_CASE__								=					n // y
										break  # find the correct factors
						else:
								break  # t is not divisible by 2, break and choose another g
		return sorted([p, q]			)


if __name__ == "__main__":
	import doctest

	doctest.testmod()