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.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class C {
    public void solve() {

    }

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);

        // read data
        long n = sc.nextLong();

        long max1 = n * 3 / 2 + 10;
        for (long x = 1; x <= max1; x++) {
            long nom = 2 * x - n;
            if (nom <= 0) {
                continue;
            }
            long den = x * n;
            long max2 = 2 * den / nom + 10;
            for (long y = 1; y <= max2; y++) {
                if (y == x) {
                    continue;
                }
                long nn = nom * y - den;
                if (nn <= 0) {
                    continue;
                }
                long dd = den * y;
                if (dd % nn == 0) {
                    long z = dd / nn;
                    if (1 <= z && z <= 1_000_000_000 && z != x && z != y) {
                        pw.printf("%d %d %d", x, y, z);
                        pw.flush();
                        return;
                    }
                }
            }
        }
        pw.print("-1");
        pw.flush();
    }

    static class FastScanner {
        private BufferedReader br;
        private StringTokenizer st;

        FastScanner(File f) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(f));
        }

        FastScanner(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }
    }
}
