3466 -- Distance to the Prey

Language:

Distance to the Prey

Time Limit: 1000MS		Memory Limit: 131072K
Total Submissions: 251		Accepted: 35

Description

Zhizhu is a intelligent spider. His mean of weaving is different from everyone:

His first web was called S₀. Then he connected five S₀ into a bigger web S₁. In the same way he got S₂, S₃, etc, as the figure above shows. Finally he finished his work S₁₀₀₀₀!

Today a insect touches the web and gets stuck. The insect is located at (a,b), and Zhizhu is at (c,d). The coordinates are all integers. He wants to know how far he needs to walk in order to reach his prey. Of course, he has to walk along the web S₁₀₀₀₀.

Input

There are multiple test cases. Each case contains one line consisting of 4 integers a, b, c, d (0 ≤ a,b,c,d ≤ 10⁹).

Output

For each test case you need to print one number, the distance Zhizhu has to walk.

Sample Input

5 3 6 4

Sample Output

Hint

The figure above is one part of S₁₀₀₀₀. Zhi zhu can walk from (6,4) to (6,3), then (5,3).

Source

POJ Monthly--2007.11.25, Yang Yi