# Codeforces Round #368 (Div. 2) C. Pythagorean Triples

C. Pythagorean Triples
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 calledPythagorean 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?

Input

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

Output

Print two integers m and k (1 ≤ m, k ≤ 1018), such that nm 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.

Examples
input
3

output
4 5
input
6

output
8 10
input
1

output
-1
input
17

output
144 145
input
67

output
2244 2245
Note

Illustration for the first sample.

(b-a) * (b+a) = n*n;

#include <stdio.h>
int main()
{
long long n;
scanf("%I64d",&n);
if(n<3)
printf("-1\n");
else
{
long long a=0,b=0;
if(n%2)
{
a=(n*n-1)/2;
b=(n*n+1)/2;
}
else
{
a=(n*n-4)/4;
b=(n*n+4)/4;
}
printf("%I64d %I64d\n",a,b);
}

return 0;
} 

• 本文已收录于以下专栏：
• Acm竞赛

## Codeforces Round #368 (Div. 2) D. Persistent Bookcase【可持久化线段树，区间取反

• Flaze_
• 2016年08月24日 16:00
• 220

## Codeforces Round #459 (Div. 2) C. The Monster

• ffgcc
• 2018年01月30日 09:48
• 47

## 【解题报告】Codeforces Round #367 (Div. 2)

• TRiddle
• 2016年08月12日 21:37
• 737

## Codeforces Round #204 (Div. 1)　A. Jeff and Rounding

A. Jeff and Rounding time limit per test 1 second memory limit per test 256 megabytes ...
• u010422038
• 2013年10月05日 08:54
• 1480

## Codeforces Round #254 (Div. 1)C. DZY Loves Colors(线段树经典操作/分块)

• fouzhe
• 2017年02月11日 15:17
• 279

## Codeforces Round #368 (Div. 2) Pythagorean Triples

C. Pythagorean Triples time limit per test 1 second memory limit per test 256 megabytes ...
• u013555159
• 2016年08月20日 23:52
• 236

## Codeforces Round #214 (Div. 2) C. Dima and Salad （背包变形）

C. Dima and Salad time limit per test 1 second memory limit per test 256 megabytes ...
• u010228612
• 2013年12月10日 22:16
• 1315

## Codeforces Round #350 (Div. 2)（C）模拟

C. Cinema time limit per test 2 seconds memory limit per test 256 megabytes input ...
• qq_24489717
• 2016年05月06日 15:29
• 481

## Codeforces Round #368 (Div. 2) Pythagorean Triples

C. Pythagorean Triples time limit per test 1 second memory limit per test 256 megabytes ...
• qaz135135135
• 2016年08月21日 13:24
• 153

## Codeforces Round #299 (Div. 2) C. Tavas and Karafs

【题意】这题看了好久好久！其实就是个二分水题！ 首先给出a,b,n 这是一个由a开头，b为公差，长度无限的等差数列 然后n个询问 输入l,t,m 取这个数列从l开始，m个数，每一次这个数...
• just_sort
• 2016年05月09日 21:02
• 205

举报原因： 您举报文章：Codeforces Round #368 (Div. 2) C. Pythagorean Triples 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)