#include <iostream>
#include <iomanip>

#include <algorithm>
#include <string>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int nibutan(int L, int R,int rr){

	int left  = L;
	int right = R;
	int mid;

	while( (R-L) > 1 ){
		mid = (R+L)/2;
		//cout << L << " " << mid << " " << R << endl;
		if( 4*rr < (mid)*(mid) ){
			R = mid;
		}else{
			L = mid;
		}
	}
	return R;
}

int main(void){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed;//
	//cout << setprecision(6);//

	int Xp,Yp;//[-10^4,10^4]
	cin>>Xp>>Yp;
	int x,y;
	x = Xp;
	y = Yp;
	int rr;
	rr = x*x+y*y;
	int ans;
	ans = nibutan(0,28300,rr);
	P(ans);
	return 0;
}