codeforces707Cdiv2Pythagorean 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?
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 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.
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

给你一个直角三角形的一边，求另外两边
勾股定理：直角三角形两条直角边a、b的平方和等于斜边c的平方（a²+b²=c²）
1）当a为大于1的奇数2n+1时，b=2n^2+2n, c=2n^2+2n+1
2）当a为大于4的偶数2n时，b=n^2-1, c=n^2+1

#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#define pi acos(-1.0)
#define EPS 1e-6
#define INF (1<<28)
#define inf 0x3f3f3f3f
using namespace std;
#define LL long long

int main(){
    LL n;
    scanf("%I64d",&n);
    if(n<=2){
        printf("-1\n");
        return 0;
    }

    if(n%2==0){
        LL temp=n/2;
        printf("%I64d %I64d\n",temp*temp-1,temp*temp+1);
    }
    else{
        LL temp=n/2;
        printf("%I64d %I64d\n",2*temp*temp+2*temp,2*temp*temp+2*temp+1);
    }
    return 0;
}