【Educational Codeforces Round 6A】【水题】Professor GukiZ's Robot 曼哈顿距离

A. Professor GukiZ's Robot

time limit per test

0.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Professor GukiZ makes a new robot. The robot are in the point with coordinates (x₁, y₁) and should go to the point (x₂, y₂). In a single step the robot can change any of its coordinates (maybe both of them) by one (decrease or increase). So the robot can move in one of the 8 directions. Find the minimal number of steps the robot should make to get the finish position.

Input

The first line contains two integers x₁, y₁ ( - 10⁹ ≤ x₁, y₁ ≤ 10⁹) — the start position of the robot.

The second line contains two integers x₂, y₂ ( - 10⁹ ≤ x₂, y₂ ≤ 10⁹) — the finish position of the robot.

Output

Print the only integer d — the minimal number of steps to get the finish position.

Examples

input

0 0
4 5

output

5

input

3 4
6 1

output

3

Note

In the first example robot should increase both of its coordinates by one four times, so it will be in position (4, 4). After that robot should simply increase its y coordinate and get the finish position.

In the second example robot should simultaneously increase x coordinate and decrease y coordinate by one three times.

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre(){freopen("c://test//input.in","r",stdin);freopen("c://test//output.out","w",stdout);}
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1,class T2>inline void gmax(T1 &a,T2 b){if(b>a)a=b;}
template <class T1,class T2>inline void gmin(T1 &a,T2 b){if(b<a)a=b;}
const int N=0,M=0,Z=1e9+7,ms63=0x3f3f3f3f;
int main()
{
	LL y1,x1,y2,x2;
	while(~scanf("%lld%lld%lld%lld",&y1,&x1,&y2,&x2))
	{
		printf("%lld\n",max(abs(y2-y1),abs(x2-x1)));
	}
	return 0;
}
/*
【trick&&吐槽】
会爆int

*/