CodeForces 559 A.Gerald's Hexagon (几何割补法)

A.Gerald’s Hexagon

Gerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to . Then he measured the length of its sides, and found that each of them is equal to an integer number of centimeters. There the properties of the hexagon ended and Gerald decided to draw on it.

He painted a few lines, parallel to the sides of the hexagon. The lines split the hexagon into regular triangles with sides of 1 centimeter. Now Gerald wonders how many triangles he has got. But there were so many of them that Gerald lost the track of his counting. Help the boy count the triangles.

Input

The first and the single line of the input contains 6 space-separated integers a1, a2, a3, a4, a5 and a6 (1 ≤ ai ≤ 1000) — the lengths of the sides of the hexagons in centimeters in the clockwise order. It is guaranteed that the hexagon with the indicated properties and the exactly such sides exists.

Output

Print a single integer — the number of triangles with the sides of one 1 centimeter, into which the hexagon is split.

Examples

Input

1 1 1 1 1 1

Output

6

Input

1 2 1 2 1 2

Output

13

Note

This is what Gerald’s hexagon looks like in the first sample:

And that’s what it looks like in the second sample:

思路：

割补法
先补成等边三角形，计算之后减去三个小三角形就行了

样例2：

第一层一个，第二层3个，第三层5个，利用等差数列公式可得：
第n层n²个

code：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define int long long
const int maxm=10;
int a[maxm];
signed main(){
    for(int i=1;i<=6;i++){
        cin>>a[i];
    }
    int ans=0;
    int n=a[1]+a[2]+a[3];
    ans+=n*n;
    ans-=a[1]*a[1]+a[3]*a[3]+a[5]*a[5];
    cout<<ans<<endl;
    return 0;
}