Polycarp takes part in a quadcopter competition. According to the rules a flying robot should:
 -  start the race from some point of a field, -  go around the flag, -  close cycle returning back to the starting point. 
Polycarp knows the coordinates of the starting point (*x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>) and the coordinates of the point where the flag is situated (*x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub>). Polycarp’s quadcopter can fly only parallel to the sides of the field each tick changing exactly one coordinate by 1. It means that in one tick the quadcopter can fly from the point (*x*, *y*) to any of four points: (*x* - 1, *y*), (*x* + 1, *y*), (*x*, *y* - 1) or (*x*, *y* + 1).

Thus the quadcopter path is a closed cycle starting and finishing in (*x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>) and containing the point (*x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub>) strictly inside.

What is the minimal length of the quadcopter path?
The first line contains two integer numbers *x*<sub class="lower-index">1</sub> and *y*<sub class="lower-index">1</sub> ( - 100 ≤ *x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub> ≤ 100) — coordinates of the quadcopter starting (and finishing) point.

The second line contains two integer numbers *x*<sub class="lower-index">2</sub> and *y*<sub class="lower-index">2</sub> ( - 100 ≤ *x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub> ≤ 100) — coordinates of the flag.

It is guaranteed that the quadcopter starting point and the flag do not coincide.
none
1 5
5 2
18
0 1
0 0
8
-100 -100
100 100
804
-100 -100
-100 100
406
-100 -100
100 -100
406
100 -100
-100 -100
406
100 -100
-100 100
804
100 -100
100 100
406
-100 100
-100 -100
406
-100 100
100 -100
804
-100 100
100 100
406
100 100
-100 -100
804
100 100
-100 100
406
100 100
100 -100
406
45 -43
45 -44
8
76 76
75 75
8
-34 -56
-35 -56
8
56 -7
55 -6
8
43 -11
43 -10
8
1 -3
2 -2
8
55 71
56 71
8
54 -87
55 -88
8
22 98
100 33
290
37 84
-83 5
402
52 74
-73 -39
480
66 51
51 -71
278
-31 44
73 86
296
-20 34
-9 55
68
-5 19
-91 -86
386
-82 5
28 -17
268
-90 -100
55 48
590
-75 -14
-32 8
134
-53 -28
-13 -28
86
-42 -46
10 -64
144
55 -42
25 2
152
70 -64
-54 70
520
93 -78
-32 -75
260
8 -93
79 -6
320
50 43
54 10
78
65 32
-37 71
286
80 18
-15 -58
346
94 92
4 -1
370
-10 96
27 64
142
-96 78
-56 32
176
-81 64
-37 -8
236
-58 49
74 -40
446
-62 -55
1 18
276
-51 -69
-78 86
368
-29 -80
-56 -47
124
-14 -94
55 -90
150
83 -2
82 83
176
98 -16
-96 40
504
17 -34
-86 -93
328
32 -48
33 -37
28
74 87
3 92
156
89 73
-80 49
390
4 58
-61 -80
410
15 48
50 -20
210
-82 45
81 46
332
-68 26
-2 6
176
-53 4
-92 -31
152
-30 94
31 -58
430
-38 -11
58 99
416
-27 -25
-28 68
192
-5 -39
-10 -77
90
-90 -54
9 -9
292
7 -57
28 61
282
18 -67
-51 21
318
41 -82
-33 -15
286
56 -8
91 -55
168
-23 -13
-24 -12
8
1 32
1 33
8
25 76
24 76
8
-29 -78
-28 -79
8
-77 19
-76 19
8
-53 63
-53 62
8
86 12
86 11
8
14 56
13 56
8
63 41
62 40
8
0 -4
1 -4
8
24 41
24 42
8
48 85
49 86
8
0 0
0 1
8
0 0
1 0
8
0 0
1 1
8
0 1
0 0
8
0 1
1 0
8
0 1
1 1
8
1 0
0 0
8
1 0
0 1
8
1 0
1 1
8
1 1
0 0
8
1 1
0 1
8
1 1
1 0
8
100 100
99 -100
406
100 100
-100 99
406
-100 -100
-99 100
406
-100 -100
100 -99
406
0 0
1 2
10
0 0
2 1
10
#!/usr/bin/env python3

x1, y1 = [int(x) for x in input().split(' ')]
x2, y2 = [int(x) for x in input().split(' ')]

xoffset = 1
yoffset = 1

if x1 == x2:
    xoffset = 2
elif y1 == y2:
    yoffset = 2

print(2*(abs(x1-x2)+xoffset)+2*(abs(y1-y2)+yoffset))
