A. Sea Battle

A. Sea Battle

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In order to make the "Sea Battle" game more interesting, Boris decided to add a new ship type to it. The ship consists of two rectangles. The first rectangle has a width of w1w1 and a height of h1h1, while the second rectangle has a width of w2w2 and a height of h2h2, where w1≥w2w1≥w2. In this game, exactly one ship is used, made up of two rectangles. There are no other ships on the field.

The rectangles are placed on field in the following way:

• the second rectangle is on top the first rectangle;
• they are aligned to the left, i.e. their left sides are on the same line;
• the rectangles are adjacent to each other without a gap.

See the pictures in the notes: the first rectangle is colored red, the second rectangle is colored blue.

Formally, let's introduce a coordinate system. Then, the leftmost bottom cell of the first rectangle has coordinates (1,1)(1,1), the rightmost top cell of the first rectangle has coordinates (w1,h1)(w1,h1), the leftmost bottom cell of the second rectangle has coordinates (1,h1+1)(1,h1+1) and the rightmost top cell of the second rectangle has coordinates (w2,h1+h2)(w2,h1+h2).

After the ship is completely destroyed, all cells neighboring by side or a corner with the ship are marked. Of course, only cells, which don't belong to the ship are marked. On the pictures in the notes such cells are colored green.

Find out how many cells should be marked after the ship is destroyed. The field of the game is infinite in any direction.

Input

Four lines contain integers w1,h1,w2w1,h1,w2 and h2h2 (1≤w1,h1,w2,h2≤1081≤w1,h1,w2,h2≤108, w1≥w2w1≥w2) — the width of the first rectangle, the height of the first rectangle, the width of the second rectangle and the height of the second rectangle. You can't rotate the rectangles.

Output

Print exactly one integer — the number of cells, which should be marked after the ship is destroyed.

Examples

input

2 1 2 1

output

12

input

2 2 1 2

output

16

Note

In the first example the field looks as follows (the first rectangle is red, the second rectangle is blue, green shows the marked squares):

In the second example the field looks as:

题意：输入4个数，前两个数表示第一个矩阵的长和宽，后两个数表示第二个矩阵的长和宽。然后找出这两个矩阵旁边的相邻单位的数量。就像上图一样，红色代表第一个矩阵，蓝色代表第二个，首先这两个矩阵必须时相邻的，然后找出旁边绿色方块的数量。我的思路就是先算出第一个矩阵的所以相邻个数，再算出第二个矩阵的相邻个数，然后再减去它们两个共同所占据的个数。

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

int main()
{
    int w1,w2,h1,h2;
    cin>>w1>>h1>>w2>>h2;
    int sum1=w1*+h1*+;    //第一个矩阵相邻单位的数量，加4的意思是4个角
    int sum2=w2*+h2*+;        //第二个矩阵相邻单位的数量
    int sum=sum1+sum2;                //两个矩阵的和
    sum-=min(w1,w2)*+;                //减去他们共同所占据的相邻单位，找两个矩阵相邻的最小边，那里才是它们的共同占据的数量单位，这里加4的意思是减去两个矩阵分别多出的两个角
    cout<<sum<<endl;
    return ;
}