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.*;
import java.math.*;
import java.io.*;

public class practice {
    public static int ans(long l,long r,long val,int ans){
        long m = l + (r - l) / 2L;
        if (val < m)
            return ans(l, m - 1, val, ans - 1);
        else if (val > m)
            return ans(m + 1, r, val, ans - 1);
        else
            return ans;
    }
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
       int n = Integer.parseInt(br.readLine());
       if(n == 1) System.out.println(-1);
       else{
           System.out.println(n + " " + (n+1) + " " + (n*(n+1)));
       }
    }
}