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.util.*;
public class ladder {
    public  static double x ,y,z ,n;
    static  double ch (){
         return (y*z)/(y+z)  ;
    }
    public static void main(String[] args) throws java.lang.Exception {
        Scanner scanner = new Scanner(System.in);
         n = scanner.nextInt();
         x =n;
        for (int i = (int)n; i <= 100000; i++) {
             y=i;
            int s=1 , e=1000000000;
            while (s<=e) {                
                
                int mid =(s+e)/2;
                z=mid;
                if(z==y) break;
                if(ch()==n){
                    System.out.println((int)x+" "+(int)y+" "+(int)z);
                    return;
                }else if(ch()<n){
                    s=mid+1;
                }else{
                    e=mid-1;
                }
            }
        }
        System.out.println("-1");
    }
}
