Problem: Given an integer x, find 2 integers a and b such that: 

  * 1 ≤ a,b ≤ x 
  * b divides a (a is divisible by b). 
  * a ⋅ b>x. 
  * a/b<x. 

Input

The only line contains the integer x (1 ≤ x ≤ 100).

Output

You should output two integers a and b, satisfying the given conditions, separated by a space. If no pair of integers satisfy the conditions above, print "-1" (without quotes).

Examples

Input

10


Output

6 3

Input

1


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)1000 * 1000 * 1000 * 1000 * 1000 * 1000;
const long long module = (long long)1000 * 1000 * 1000 + 7;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long x;
  cin >> x;
  for (long long i = 1; i <= x; i++) {
    for (long long j = 1; j <= x; j++) {
      if (i >= j && i % j == 0 && i / j < x && i * j > x) {
        cout << i << " " << j << "\n";
        return 0;
      }
    }
  }
  cout << -1 << "\n";
  return 0;
}