#include<stdio.h> #include<string.h> #include<math.h> #include<time.h> #include<map> #include<ctype.h> #include<iostream> #include<algorithm> #include<stdlib.h> #include<queue> #include<stack> using namespace std; #define LL long long const int N=1010000; void solv(int n,int &l,int &r,int &lev) { int i; lev=1; for(i=1;;i+=2) { if(n-i<=0) { l=(n+1)/2; r=(i-n)/2+1; break; } lev++; n-=i; } } int main() { int n,m,j,i,l,nr,nl,mr,ml,nc,mc; while(~scanf("%d%d",&n,&m)) { solv(n,nl,nr,nc); solv(m,ml,mr,mc); printf("%d ",abs(nl-ml)+abs(nr-mr)+abs(nc-mc)); } }