Problem Statement

yuki has decided to wrap a box containing a present for his friend with ribbons.
Since the present is very heavy, he plans to wind the ribbons around the box many times just to be safe.

yuki wraps the rectangular cuboid box as follows.
- The red ribbon is wound \(R\) times around the four faces of the cuboid: top, back, bottom, and front.
- The blue ribbon is wound \(B\) times around the four faces of the cuboid: top, left, bottom, and right.
- The yellow ribbon is wound \(Y\) times around the four faces of the cuboid: front, right, back, and left.

Each ribbon is wound so that it passes through the midpoints of the edges of the cuboid and has no slack. The ribbons are extremely thin, so their thickness may be ignored.
The figure below shows an example of the wrapping.


The orientation of the box can be rotated freely.
Given the lengths of the three edges of the box and the number of times to wind each ribbon, find the minimum total length of the ribbons of the three colors required for the wrapping.

Input

\(L_1, L_2, L_3\)
\(R\) \(B\) \(Y\)

\(L_1, L_2, L_3\) are integers representing the lengths of the three edges of the present box, and satisfy \(1\le L_1, L_2, L_3 \le 100\).
\(R, B, Y\) are integers representing the numbers of times to wind the ribbons as described in the problem statement, and satisfy \(0\le R, B, Y \le 100\).

Output

Output the minimum total length of the required ribbons on one line.

Sample

3 4 5
1 1 2

62

10 10 10
5 0 3

320

56 34 12
7 8 9

3176