A*B*C#11800

A*B*C

1 second
256 megabytes
Medium

All you need is to represent the natural number as the product of three distinct natural numbers greater than one (or say that it is impossible).

Input

The input consists of a single natural number such that N \le 10^9.

Output

You need to output three different integers , , (2 \le a, b, c \le 10^9) separated by spaces, whose product is exactly . If this is not possible, output three zeros separated by spaces. If there are multiple solutions, you may output any of them.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading