Factorization

One evening, mathematician Petrov M.M. visited us. He had been studying the original sources of PGP (version $0.000001$) and found a flaw in the public key generation algorithm of a well-known cryptographic system.

In this system, the key is the product of two large, distinct prime numbers. Petrov asserts that if these numbers are very close to each other, factoring the key becomes relatively easy. The programmer responsible for the PGP module overlooked this issue, only ensuring that the factors were different.

You are given a number $n$, which is the product of two prime numbers $p$ and $q$.

Your task is to identify these numbers.

Output

If it turns out that p = q, then output the line Impossible. Otherwise, print the smaller factor on the first line and the larger factor on the second line.