#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    double x,y;
    cin >> x >> y;
    double l = sqrt(x*x+y*y);
    double rad = int(l);
    int ans = INF;
    while (true){
        if (rad>l){
            ans = int(rad * 2);
            break;
        } else rad += 0.5;
    }
    cout << ans << endl;
    return 0;
}