<h1 id="heading">题目</h1>
<blockquote>
<h2 id="description">Description</h2>
<blockquote>
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
 
</blockquote>
<h2 id="input">Input</h2>
<blockquote>
The only line of the input contains single integer n (1 ≤ n ≤ 109) — the length of some side of a right triangle.
</blockquote>
<h2 id="output">Output</h2>
<blockquote>
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.
</blockquote>
<h2 id="examples">Examples</h2>
<blockquote>
<h3 id="input-1">input</h3>
<blockquote>
3
</blockquote>
<h3 id="output-1">output</h3>
<blockquote>
4 5
</blockquote>
<h3 id="input-2">input</h3>
<blockquote>
6
</blockquote>
<h3 id="output-2">output</h3>
<blockquote>
8 10
</blockquote>
<h3 id="input-3">input</h3>
<blockquote>
1
</blockquote>
<h3 id="output-3">output</h3>
<blockquote>
-1
</blockquote>
<h3 id="input-4">input</h3>
<blockquote>
17
</blockquote>
<h3 id="output-4">output</h3>
<blockquote>
144 145
</blockquote>
<h3 id="input-5">input</h3>
<blockquote>
67
</blockquote>
<h3 id="output-5">output</h3>
<blockquote>
2244 2245
</blockquote>
</blockquote>
</blockquote>
<h1 id="heading-1">题解</h1>
对于完全平方数,有 
<code>2n</code> <code>n2-1</code> <code>n2+1</code> 
<code>2n+1</code> <code>2n2+2n</code> <code>2n2+2n+1</code> 
两种形式 
分别计算即可
当然,奇数直接 <code>3</code> <code>4</code> <code>5</code> 等比例扩大也行
<h1 id="heading-2">代码</h1>
<pre style="background-color:#fff">/*
By:OhYee
Github:OhYee
HomePage:http://www.oyohyee.com
Email:oyohyee@oyohyee.com

かしこいかわいい？
エリーチカ！
要写出来Хорошо的代码哦~
*/

#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;string&gt;
#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;list&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;map&gt;
#include &lt;set&gt;
using namespace std;

const int maxn = 100005;
const int INF = 0x7FFFFFFF;


bool Do() {
 __int64 n;
 if(scanf(&#34;%I64d&#34;,&amp;n) == EOF)
 return false;
 if(n == 1 || n == 2)
 printf(&#34;-1\n&#34;);
 else
 if(n % 2) {
 n = (n - 1) / 2;
 printf(&#34;%I64d %I64d\n&#34;,2 * n*n + 2 * n,2 * n*n + 2 * n + 1);

 } else {
 n /= 2;
 printf(&#34;%I64d %I64d\n&#34;,n*n - 1,n*n + 1);
 }



 return true;
}

int main() {
 while(Do());
 return 0;
}
</pre>

Codeforces 707C.Pythagorean Triples