You are given an integer N.

Find a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.

If there are multiple solutions, any of them will be accepted.

Constraints

* It is guaranteed that, for the given integer N, there exists a solution such that h,n,w \leq 3500.

Inputs

Input is given from Standard Input in the following format:


N


Outputs

Print a triple of positive integers h, n and w that satisfies the condition, in the following format:


h n w

Examples

Input

2


Output

1 2 2


Input

3485


Output

872 1012974 1539173474040


Input

4664


Output

3498 3498 3498
import java.io.ByteArrayInputStream;
import java.io.UnsupportedEncodingException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Main {
    private static String solve(Scanner scanner) {
        long N = Integer.parseInt(scanner.nextLine());

        for (long n = 3500; n >= 1; n --) {
            for (long w = 3500; w >= 1; w --) {
                long denom = 4 * n * w - N * w - N * n;
                long numer = N * n * w;

                if (denom > 0 && numer % denom == 0) {
//                    System.out.println(denom);
//                    System.out.println(numer);

                    long h = numer / denom;
                    return n + " " + w + " " + h;
                }
            }
        }

        return null;
    }

    public static void main(String[] args) {
//        tests();

        Scanner scanner = new Scanner(System.in);
        System.out.println(solve(scanner));
    }

    private static String[] testCases = {
            "2",
            "3485",
            "4664"
    };

    private static void tests() {
        for (String t: testCases) {
            System.out.println(solve(new Scanner(testCaseToInputStream(t))));
        }
    }

    private static ByteArrayInputStream testCaseToInputStream(String ex) {
        try {
            return new ByteArrayInputStream(ex.getBytes("utf-8"));
        } catch (UnsupportedEncodingException e) {
            e.printStackTrace();
            throw new RuntimeException();
        }
    }

    private static int[] lineToIntNums(String line) {
        String[] numStrs = line.split(" ");
        int[] nums = new int[numStrs.length];
        for (int i = 0; i < nums.length; i ++) {
            nums[i] = Integer.parseInt(numStrs[i]);
        }
        return nums;
    }
}
