#P1285C. Fadi and LCM
Fadi and LCM
No submission language available for this problem.
Description
Today, Osama gave Fadi an integer , and Fadi was wondering about the minimum possible value of such that equals . Both and should be positive integers.
is the smallest positive integer that is divisible by both and . For example, , , .
Of course, Fadi immediately knew the answer. Can you be just like Fadi and find any such pair?
The first and only line contains an integer ().
Print two positive integers, and , such that the value of is minimum possible and equals . If there are several possible such pairs, you can print any.
Input
The first and only line contains an integer ().
Output
Print two positive integers, and , such that the value of is minimum possible and equals . If there are several possible such pairs, you can print any.