C. Pythagorean Triples

https://codeforc.es/problemset/problem/707/C

勾股定理构造：k为奇数  (2k+1,2k^2+2k,2k^2+2k+1).  k为偶数： (2k,k^2-1,k^2+1)

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e7+9;
const int maxm=1e6+9;


int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    ll n;
    cin>>n;
    if(n<=2)
    {
        cout<<-1<<endl;
        return 0;
    }
    if(n%2)
    {
        ll k=n/2;
        cout<<2*k*k+2*k<<" "<<2*k*k+2*k+1<<endl;
    }
    else
    {
        ll k=n/2;
        cout<<k*k-1<<" "<<k*k+1<<endl;
    }

    return 0;
}