CF910B.Door Frames

Petya has equal wooden bars of length n. He wants to make a frame for two equal doors. Each frame has two vertical (left and right) sides of length a and one top side of length b. A solid (i.e. continuous without breaks) piece of bar is needed for each side.

Determine a minimal number of wooden bars which are needed to make the frames for two doors. Petya can cut the wooden bars into any parts, but each side of each door should be a solid piece of a wooden bar (or a whole wooden bar).

彼得有若干根长度均为 $n$ 的相同木条。他想用这些木条制作两扇尺寸完全相同的门的门框。每个门框由两条竖直边（左、右）和一条横边（顶部）组成，其中每条竖直边长度为 $a$，横边长度为 $b$。每条边都必须由一根完整连续（即不可拼接）的木条（或其一段）构成。

请确定制作两扇门的门框所需的最少木条数量。彼得可以将木条任意切割成若干段，但每扇门的每条边都必须是一整根木条（或其某一段），不能由多段拼接而成。

The first line contains a single integer n (1 ≤ n ≤ 1 000) — the length of each wooden bar.

The second line contains a single integer a (1 ≤ a ≤ n) — the length of the vertical (left and right) sides of a door frame.

The third line contains a single integer b (1 ≤ b ≤ n) — the length of the upper side of a door frame.

第一行包含一个整数 $n$（$1 \leq n \leq 1\,000$）——每根木条的长度。

第二行包含一个整数 $a$（$1 \leq a \leq n$）——门框垂直边（左侧和右侧）的长度。

第三行包含一个整数 $b$（$1 \leq b \leq n$）——门框上边的长度。

Print the minimal number of wooden bars with length n which are needed to make the frames for two doors.

打印制作两扇门的框架所需的长度为 $n$ 的木条的最少数量。

In the first example one wooden bar is enough, since the total length of all six sides of the frames for two doors is 8.

In the second example 6 wooden bars is enough, because for each side of the frames the new wooden bar is needed.

在第一个例子中，一根木条就足够了，因为两个门框的六条边的总长度为 8。

在第二个例子中，六根木条就足够了，因为门框的每一条边都需要一根新的木条。