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
import java.io.*;
import java.util.*;
public class ProblemC {
static long gcd(long a, long b)
{
	if(a == 0 || b == 0) {if(a != 0) return a; else return b;}
	else return gcd(b, a % b);
}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
	    int n = scan.nextInt();
	    int a; int b; int c;
	    boolean toggle = false;
	    long p; long q;
	    for(long x = n + 1; x >= n/2 + 1; x--)
	    {
	    	long d = (n*x)/(2*x - n);
	    	for(long e = 2*d; e >= Math.max(d, x+1); e--)
	    	{
	    		p = 2*e*x - n*x - n*e;
	    		q = n*x*e;
	    		if(gcd(p,q) == p && x > 0 && p > 0 && e > 0 && q/p != x 
	    				&& q/p != e && e != x
	    				&& x < Math.pow(10, 9) && e < Math.pow(10,9) && q/p 
	    				< Math.pow(10, 9))
	    		{
	    			System.out.println(x + " " + e + " " + q/p);
	    			e = Math.max(d, x+1); x = n/2 + 1;
	    			toggle = true;
	    			
	    		}
	    	}
	    	}
	    if(!toggle)System.out.println(-1);
	    }

}
