Candy Boxes

Petya lives in city P, where a candy factory makes very tasty candies. Petya plans to travel by train to city M to visit his friend Vasya. He wants to bring as many boxes of candy as possible as a gift.

Each candy box has size $a \times b \times c$ cm, where $a$ is the length, $b$ is the width, and $c$ is the height. Petya uses one large box shaped like a rectangular parallelepiped. All candy boxes must fit inside it. Each candy box must keep its original orientation, and all of them must face the same direction. Petya may choose any size for the large box, but the sum of its three dimensions cannot exceed $N$ cm under the railway rules.

Write a program that, given $N$, $a$, $b$, and $c$, finds the size of the box Petya should use so that it holds the maximum number of candy boxes.

The first line contains four integers separated by spaces: $N$, $a$, $b$, and $c$ ($1 \le N, a, b, c \le 10^9$).

Print three numbers: the length, width, and height of the box Petya should choose, so that the maximum number of candy boxes fits. If several answers are possible, print any of them.

In the first example, the best choice is a $3 \times 4 \times 3$ cm box. Three candy boxes fit along the length, two along the width, and one along the height.

In the second example, at least two candy boxes require a box of at least $8 \times 3 \times 4$ cm, whose dimensions sum to 15. Such a box holds at most one candy box. The $9 \times 3 \times 2$ box is also a valid answer, even though it is not the smallest one.