#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include<utility>
using namespace std;
int main(void) {
int64_t y1,x1,y2,x2;
cin >> y1 >> x1 >> y2 >> x2;
y1=-y1;
y2=-y2;
int64_t block1cx,block1cy,block2cx,block2cy,block1pcx,block1pcy,block2pcx,block2pcy;
int64_t block1=-1,block2=-1;
int64_t found=2;
if(x1 <= 2 && y1 <= 4 && x1 >= 0 && y1 >= 0) {
found--;
block1=0;
block1cx=0;
block1cy=0;
block1pcx=0;
block1pcy=0;
} else if(x1 >= -6 && x1 < 0 && y1 >= -12 && y1 <= 4) {
found--;
block1=1;
block1cx=-1;
block1cy=-1;
block1pcx=-1;
block1pcy=-1;
}
if(x2 <= 2 && y2 <= 4 && x2 >= 0 && y2 >= 0) {
found--;
block2=0;
block2cx=0;
block2cy=0;
block2pcx=0;
block2pcy=0;
} else if(x2 >= -6 && x2 < 0 && y2 >= -12 && y2 <= 4) {
found--;
block2=1;
block2cx=-1;
block2cy=-1;
block2pcx=-1;
block2pcy=-1;
}
int64_t cornerx=-6, cornery=-12;
int64_t cornerx0=0, cornery0=0;
int64_t step=0;
int64_t jump=32;
int64_t blocknum=2;
int64_t width=16,height=6;
while(found>0) {
if(step%4 == 0) {
width=jump-height;
height=cornery0 - cornery-1;
cornerx+=jump;
cornerx0+=jump/16;
/*cout << cornerx-width << " to " << cornerx << endl;
cout << cornery << " to " << cornery+height << endl;*/
if(y1 >= cornery && y1 <= cornery+height && x1 <= cornerx && x1 >= cornerx - width) {
block1=blocknum;
block1cx=cornerx0+1;
block1cy=cornery0-1;
block1pcx=cornerx0-jump/16-1;
block1pcy=cornery0-1;
found--;
}
if(y2 >= cornery && y2 <= cornery+height && x2 <= cornerx && x2 >= cornerx - width) {
block2=blocknum;
block2cx=cornerx0+1;
block2cy=cornery0-1;
block2pcx=cornerx0-jump/16-1;
block2pcy=cornery0-1;
found--;
}
} else if(step%4 == 1) {
width=jump-height;
height=cornerx - cornerx0-1;
cornery+=jump;
cornery0+=jump/16;
if(y1 >= cornery-width && y1 <= cornery && x1 <= cornerx && x1 >= cornerx - height) {
block1=blocknum;
block1cx=cornerx0+1;
block1cy=cornery0+1;
block1pcx=cornerx0+1;
block1pcy=cornery0-jump/16-1;
found--;
}
if(y2 >= cornery-width && y2 <= cornery && x2 <= cornerx && x2 >= cornerx - height) {
block2=blocknum;
block2cx=cornerx0+1;
block2cy=cornery0+1;
block2pcx=cornerx0+1;
block2pcy=cornery0-jump/16-1;
found--;
}
} else if(step%4 == 2) {
width=jump-height;
height=cornery - cornery0-1;
cornerx-=jump;
cornerx0-=jump/16;
if(y1 >= cornery-height && y1 <= cornery && x1 <= cornerx+width && x1 >= cornerx) {
block1=blocknum;
block1cx=cornerx0-1;
block1cy=cornery0+1;
block1pcx=cornerx0+jump/16+1;
block1pcy=cornery0-1;
found--;
}
if(y2 >= cornery-height && y2 <= cornery && x2 <= cornerx+width && x2 >= cornerx) {
block2=blocknum;
block2cx=cornerx0-1;
block2cy=cornery0+1;
block2pcx=cornerx0+jump/16+1;
block2pcy=cornery0-1;
found--;
}
} else if(step%4 == 3) {
width=jump-height;
height=cornerx0 - cornerx-1;
cornery-=jump;
cornery0-=jump/16;
if(y1 >= cornery && y1 <= cornery+width && x1 <= cornerx+height && x1 >= cornerx) {
block1=blocknum;
block1cx=cornerx0-1;
block1cy=cornery0-1;
block1pcx=cornerx0-1;
block1pcy=cornery0+jump/16+1;
found--;
}
if(y2 >= cornery && y2 <= cornery+width && x2 <= cornerx+height && x2 >= cornerx) {
block2=blocknum;
block2cx=cornerx0-1;
block2cy=cornery0-1;
block2pcx=cornerx0-1;
block2pcy=cornery0+jump/16+1;
found--;
}
}
jump*=2;
step++;
blocknum++;
}
if(block2 < block1) {
swap(block2,block1);
swap(block2cx,block1cx);
swap(block2cy,block1cy);
swap(block2pcx,block1pcx);
swap(block2pcy,block1pcy);
swap(x1,x2);
swap(y1,y2);
}
if(block1 == block2) {
cout << abs(x1 - x2) + abs(y1 - y2) << endl;
return 0;
}
if(block1 == 0) {
if(block2 == 1) {
cout << abs(x1 - x2) + abs(y1 - y2) << endl;
return 0;
} else {
int64_t steps=0;
steps+=abs(x1 + 1) + abs(y1 + 1);
int64_t nextstep=2;
for(int64_t i=2;i<=block2-1;i++) {
steps+=nextstep+2;
nextstep*=2;
}
steps+=abs(block2pcx - x2) + abs(block2pcy - y2);
cout << steps << endl;
return 0;
}
}
/*cout << "HERE!" << block1 << " " << block2 << endl;
cout << block1cx << "," << block1cy << endl;
cout << block1pcx << "," << block1pcy << endl;*/
int64_t steps=abs(x1 - block1cx) + abs(y1 - block1cy);
//cout << "Moving to da place: " << steps << endl;
int64_t nextstep=((int64_t) 1) << ((int64_t) block1);
for(int64_t i=block1;i<block2-1;i++) {
//cout << "Adding steps: " << nextstep+2 << endl;
steps+=nextstep+2;
nextstep*=2;
}
steps+=abs(block2pcx - x2) + abs(block2pcy - y2);
cout << steps << endl;
return 0;
}
