Square GG

Myungjun could not solve the easy problem 제곱 ㄴㄴ, so he made 제곱ㄱㄱ numbers by reversing the 제곱ㄴㄴ numbers.

A positive integer $X$ is called a 제곱ㄱㄱ number if, for every prime factor $p$ of $X$, $p^2$ is also a divisor of $X$. The first 제곱ㄱㄱ numbers are 1, 4, 8, 9, 16, 25, 27, 32, ...

Finding a single 제곱ㄱㄱ number is easy, because any perfect power is one. Myungjun also found that every 제곱ㄱㄱ number can be written as a perfect square multiplied by a perfect cube.

Since finding one 제곱ㄱㄱ number of a given size is easy, Myungjun wants to find cases where two consecutive positive integers are both 제곱ㄱㄱ numbers. Help him check whether such a pair exists at the size he wants.

The first line contains an integer $N$ ($0 \le N < 1000$).

Find $A$ such that both $A$ and $A+1$ are 제곱ㄱㄱ numbers and $100N \le A < 100N+1$.

If such an $A$ exists, print on the first line two positive integers $B$ and $C$ with $A = B^2C^3$.

On the second line, print two positive integers $D$ and $E$ with $A+1 = D^2E^3$.

If several values of $A$ satisfy the condition, print the answer for any one of them.

If no such $A$ exists, print -1 on the first line and stop.