The problem is that the president of Flatland doesn’t like the number x. Therefore the minister of finances was instructed to choose such a and b that it is impossible to pay exactly x tupiks without change. On the other hand it must be possible to pay all amounts larger than x.
Now you are asked to help him — choose such a and b, or recommend the minister to retire, if it is impossible.
Input file contains one number x (1 ≤ x ≤ 1012).
Output two integer numbers a and b, such that it is impossible to pay x tupiks using banknotes of a and b tupiks without change, but it is possible to pay any larger sum. If it is impossible, output two zeroes to the output file.
Andrew Stankevich Contest 21
No tag edit access