#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = 1000000007;

int main(){
    int X,Y;
    cin >> X >> Y;

    int res = 0;
    res = (int)(ceil(sqrt((double(X*X+Y*Y)+0.001))*2));

    cout << res << endl;
    return 0;
}