CF707C.Pythagorean Triples

Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths corresponding to triple. Such triples are called Pythagorean triples.

For example, triples (3, 4, 5), (5, 12, 13) and (6, 8, 10) are Pythagorean triples.

Here Katya wondered if she can specify the length of some side of right triangle and find any Pythagorean triple corresponding to such length? Note that the side which length is specified can be a cathetus as well as hypotenuse.

Katya had no problems with completing this task. Will you do the same?

卡佳正在上五年级。最近，她的班级学习了直角三角形和勾股定理。人们发现，存在一些正整数三元组，使得以该三元组中三个数为边长可以构成一个直角三角形。这样的三元组被称为勾股数（Pythagorean triples）。

例如，三元组 $(3,\,4,\,5)$、$(5,\,12,\,13)$ 和 $(6,\,8,\,10)$ 都是勾股数。

这时卡佳想到一个问题：她能否指定直角三角形某一条边的长度，并找出一个与之对应的勾股数？注意，所指定长度的这条边既可以是直角边（即“勾”或“股”），也可以是斜边（即“弦”）。

卡佳轻而易举地完成了这项任务。你也能做到吗？

The only line of the input contains single integer n (1 ≤ n ≤ 109) — the length of some side of a right triangle.

输入仅包含一行，其中有一个整数 $n$（$1 \leq n \leq 10^9$）——某个直角三角形的一条边的长度。

Print two integers m and k (1 ≤ m, k ≤ 1018), such that n, m and k form a Pythagorean triple, in the only line.

In case if there is no any Pythagorean triple containing integer n, print  - 1 in the only line. If there are many answers, print any of them.

在一行中输出两个整数 $m$ 和 $k$（$1 \le m, k \le 10^{18}$），使得 $n$、$m$ 和 $k$ 构成一个勾股数组。

如果不存在包含整数 $n$ 的勾股数组，则在一行中输出 $-1$。若存在多个答案，输出任意一个即可。

Illustration for the first sample.

第一个样例的示意图。