Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer n he can represent fraction <image> as a sum of three distinct positive fractions in form <image>.

Help Vladik with that, i.e for a given n find three distinct positive integers x, y and z such that <image>. Because Chloe can't check Vladik's answer if the numbers are large, he asks you to print numbers not exceeding 109.

If there is no such answer, print -1.

Input

The single line contains single integer n (1 ≤ n ≤ 104).

Output

If the answer exists, print 3 distinct numbers x, y and z (1 ≤ x, y, z ≤ 109, x ≠ y, x ≠ z, y ≠ z). Otherwise print -1.

If there are multiple answers, print any of them.

Examples

Input

3


Output

2 7 42


Input

7


Output

7 8 56
//Codeforces Round 384 (Div. 2)
import java.io.*;
import java.util.*;

public class TaskC {	
	
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);        

		int n = sc.nextInt();
        
        if (n == 1) {
        	/*for (int x = 1; x < 1000; x++)
        		for (int y = 1; y < 1000; y++)
        			for (int z = 1; z < 1000; z++) {
        				if (x != y && x != z && y != z && (2*x*y*z == x*y + y*z + z*x)) {
        					pw.println(x + " " + y + " " + z);
        					break;
        				}
        			}*/
        	pw.println(-1);		
        } else {
        	pw.println(n + " " + (n+1) + " " + ((n+1)*n));
        }        
        
        pw.close();		
	}
}