#include <bits/stdc++.h>
using namespace std;
vector<int> noprimes(1000001);
void seive(vector<int> &primes, int n) {
  vector<bool> ntprimes(n + 1, false);
  ntprimes[0] = ntprimes[1] = true;
  for (int i = 2; i * i <= n; i++) {
    if (!ntprimes[i]) {
      for (int j = i * i; j <= n; j += i) {
        ntprimes[j] = true;
      }
    }
  }
  int x = 0;
  for (int i = 2; i <= n; i++) {
    if (!ntprimes[i]) {
      primes.push_back(i);
      x++;
      noprimes[i] = x;
    } else
      noprimes[i] = x;
  }
}
long long fpow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n % 2 == 0) {
      n = n / 2;
      x = x * x;
    } else {
      res *= x;
      n--;
    }
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  if (n % 2) {
    long long a = ((n + 1) * (n - 1)) / 2;
    long long b = ((n + 1) * (n + 1) + (n - 1) * (n - 1)) / 4;
    if (a != 0 && b != 0)
      cout << a << ' ' << b;
    else
      cout << -1;
  } else {
    long long a = (n * n) / 4 - 1;
    long long b = (n * n) / 4 + 1;
    if (a != 0 && b != 0) {
      cout << a << " " << b;
    } else
      cout << -1;
  }
  return 0;
}
