K. Keep Them Stacked
time limit per test
0.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

This year, you joined PLT (Programming Language Tournament) with Alice and Bob, but all of you were very struggled as the problems were tremendously hard.

"We can't even do a single problem..." Alice mumbled.

"Look at that team! They are stacking the problem statement papers for the problems they have solved!" Bob yelled.

You noticed all the problem statement papers were rectangles with different widths and heights. You then said accordingly, "We should stack papers as well! We could pretend we have solved many problems already!" "...But do you know what is the smallest possible area to stack these 3 papers without rotation?" Bob smirked.

Notice that intersected areas of different papers are only counted once. Please find the smallest possible area to stack those 3 papers without rotation if you could place the papers anywhere you want, as you and Bob were interested to figure out the answer.

Input

The first line contains 6 positive integers, $$$H_1, W_1, H_2, W_2, H_3, W_3$$$ ($$$1 \leq H_i, W_i \leq 100$$$), where $$$H_i$$$ is the height of the $$$i^{th}$$$ rectangle paper and $$$W_i$$$ is the width of the $$$i^{th}$$$ rectangle paper.

Output

Output a single integer, the smallest possible area to stack those 3 papers without rotation.

Example
Input
1 5 3 2 5 4
Output
21