A. Ehab and another construction problemtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven an integer x, find 2 integers a and b such that:   1 \le a,b \le x  b divides a (a is divisible by b).  a \cdot b>x.  \frac{a}{b}<x. InputThe only line contains the integer x (1 \le x \le 100).OutputYou should output two integers a and b, satisfying the given conditions, separated by a space. If no pair of integers satisfy the conditions above, print "-1" (without quotes).ExamplesInput10Output6 3Input1Output-1
Input10
Output6 3
['brute force', 'constructive algorithms', '*800']