Welcome to ZOJ
 Problem Sets Information Select Problem Runs Ranklist
ZOJ Problem Set - 3069
Box walking

Time Limit: 1 Second      Memory Limit: 32768 KB

You are given a three-dimensional box of integral dimensions lx * ly * lz The edges of the box are axis-aligned, and one corner of the box is located at position (0, 0, 0). Given the coordinates (x, y , z) of some arbitrary position on the surface of the box, your goal is to return the square of the length of the shortest path along the box’s surface from (0, 0, 0) to (x, y , z).

If lx = 1, ly = 2, and lz = 1, then the shortest path from (0, 0, 0) to (1, 2, 1) is found by walking from (0, 0, 0) to (1, 1, 0), followed by walking from (1, 1, 0) to (1, 2, 1). The total path length is sqrt(8).

Input

The input test file will contain multiple test cases, each of which consists of six integers lx, ly, lz, x, y, z where 1 <= lx, ly, lz <= 1000. Note that the box may have zero volume, but the point (x, y, z) is always guaranteed to be on one of the six sides of the box. The end-of-file is marked by a test case with lx = ly = lz = x = y = z = 0 and should not be processed.

Output

For each test case, write a single line with a positive integer indicating the square of the shortest path length. (Note: The square of the path length is always an integer; thus, your answer is exact, not approximate.)

Sample Input

```1 1 2 1 1 2
1 1 1 1 1 1
0 0 0 0 0 0
```

Sample Input

```8
5
```

Source: 2005 Stanford Local Programming Contest
Submit    Status