Beer Refrigerator | 프로그래밍의 벗 PivotOJ
PivotOJ

Beer Refrigerator

시간 제한: 1000ms메모리 제한: 128MB출처: NEERC Northern Subregional 2007BOJ 3595

문제

Beer Lovers Club makes regular parties. They hate warm beer, but club’s refrigerator is too small to store enough beer for the whole company. So they decided to order a special super-big beer refrigerator. The new refrigerator should be a parallelepiped a × b × c and store exactly n cubical 1 × 1 × 1 beer boxes (the club has n members). To decrease losses of cold, the total area of the surface of the refrigerator must be as small as possible.

For example, if the capacity of the refrigerator must be 12, the possible variants are:

Dimensions Surface Area
3 × 2 × 2 32
4 × 3 × 1 38
6 × 2 × 1 40
12 × 1 × 1 50

The best variant in this case is 3 × 2 × 2.

Help the beer lovers to find the optimal dimensions for their new refrigerator.

입력

The input file contains single integer number n (1 ≤ n ≤ 106) — the capacity of the refrigerator.

출력

Output three integer numbers: a, b and c — the optimal dimensions of the refrigerator. If there are several solutions, output any of them.

예제

예제 1

입력
12
출력
3 2 2

예제 2

입력
13
출력
1 13 1

예제 3

입력
1000000
출력
100 100 100
코드를 제출하려면 로그인하세요.