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
/*
 *
 * @author Rudrakh97
 */
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;

public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
		long n = sc.nextLong();
		if(n==1)
		{
		    System.out.println("-1");
		    return;
		}
		for(long i = (n/2)+1;i<=n;++i)
		{
		    for(long j=Math.max(i+1,(n*i)/(2*i-n));j<1000000001;++j)
		    {
		        //System.out.println("processing:"+i+" "+j);
		        if(2*i*j <= n*(i+j))
		            continue;
		        long lim = (n*i*j)/(2*i*j - n*(i+j));
		        long num = n*i*j;
		        long den = i*2*j-j*n-n*i;
		        if(num%den==0 && lim<=1000000000 && lim!=i && lim!=j)
		        {
		            //System.out.println(num+" "+den);
		             System.out.println(i+" "+j+" "+lim);
		             return;
		        }
		    }
		}
		System.out.println("-1");
	}
}