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 JAVA):

Solution:


import jdk.nashorn.internal.ir.BinaryNode;
import jdk.nashorn.internal.ir.Flags;

import java.util.*;
import java.util.concurrent.CopyOnWriteArrayList;
import java.util.Arrays;
import java.util.Collections;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int x = scanner.nextInt();
        boolean flag = false;
        int a = 0;
        int b = 0;
        for (int i = 1; i <= x; i++) {
            for (int j = 1; j <= x; j++) {
                if ((i % j == 0) && (i * j > x) && ((i / j) < x)) {
                    a = i;
                    b = j;
                    flag =true;
                    break;
                }
            }

        }
        if (flag) {
            System.out.print(a + " ");
            System.out.print(b);
        }else{
            System.out.println(-1);
        }

    }

}