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 int maxn = 1000000 + 10;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const double eps = 1e-10;
const double pi = acos(-1);
int T, cases, n, m;
int main() {
  ios::sync_with_stdio(false);
  ;
  cin >> n;
  for (int a = 1; a <= n; a++)
    for (int b = 1; b <= n; b++) {
      if (a % b == 0 && a * b > n && a < b * n) {
        cout << a << " " << b << endl;
        return 0;
      }
    }
  cout << "-1" << endl;
  return 0;
}