Teleportation

Description

One of the farming chores Farmer John dislikes the most is hauling around lots of cow manure. In order to streamline this process, he comes up with a brilliant invention: the manure teleporter! Instead of hauling manure between two points in a cart behind his tractor, he can use the manure teleporter to instantly transport manure from one location to another.

Farmer John's farm is built along a single long straight road, so any location on his farm can be described simply using its position along this road (effectively a point on the number line). A teleporter is described by two numbers xx and yy, where manure brought to location xxcan be instantly transported to location yy, or vice versa.

Farmer John wants to transport manure from location aa to location bb, and he has built a teleporter that might be helpful during this process (of course, he doesn't need to use the teleporter if it doesn't help). Please help him determine the minimum amount of total distance he needs to haul the manure using his tractor.

Input

The first and only line of input contains four space-separated integers: aa and bb, describing the start and end locations, followed by xx and yy, describing the teleporter. All positions are integers in the range 0…1000…100, and they are not necessarily distinct from each-other.

Output

Print a single integer giving the minimum distance Farmer John needs to haul manure in his tractor.

Example

input

3 10 8 2

output

3

Note

In this example, the best strategy is to haul the manure from position 3 to position 2, teleport it to position 8, then haul it to position 10. The total distance requiring the tractor is therefore 1 + 2 = 3.

解析

从某个地方到某个地方，然后有x到y的传送门。希望走的路程最少。

（那自然是能利用传送门就用啦!）

WA点：注意a,b和x,y的大小（选定一个方向，例a<=b&&x<=y，或a>=b&&x>=y）

代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
int main()
{
    int a,b,x,y;
    scanf("%d %d %d %d",&a,&b,&x,&y);
    if(x>y) swap(x,y);//选定方向
    if(a>b) swap(a,b);//同上
    int ans=min(b-a,abs(a-x)+abs(b-y));
//有可能先往回走一点去传送门，此时为负数，但是路程是正...
    printf("%d\n",ans);
    return 0;
}