#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, i, j, k, a, b, c, x, y, z;
  cin >> n;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      a = max(i, j);
      b = min(i, j);
      if (a % b == 0) {
        if (a * b > n && a / b < n) {
          printf("%d %d\n", a, b);
          return 0;
        }
      }
    }
  }
  printf("-1\n");
  return 0;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, i, j, k, a, b, c, x, y, z;
  cin >> n;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      a = max(i, j);
      b = min(i, j);
      if (a % b == 0) {
        if (a * b > n && a / b < n) {
          printf("%d %d\n", a, b);
          return 0;
        }
      }
    }
  }
  printf("-1\n");
  return 0;
}

```