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 BruteForce {

    public static Scanner in = new Scanner(System.in);

    public static boolean check(double n, double x, double y) {
        boolean ans = false;
        if ((x * y) / (x + y) == n) {
            ans = true;
        }
        return ans;
    }

    public static void main(String[] args) {
        double n = in.nextDouble();
        ArrayList<Double> list = new ArrayList<Double>();
        boolean ans = false;
        for (double i = 1; i <= 20000; i++) {
            double x = i;
            double y = x * n;
            if (check(n, x, y)&&x!=y) {
                ans = true;
                list.add(n);
                list.add(x);
                list.add(y);
                break;
            }
        }
        if (ans) {
            for (double val : list) {
                System.out.print((int) val + " ");
            }
            System.out.println("");
        } else {
            System.out.println("-1");
        }
    }
}