#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int nn2 = 2e6;
    vector<long long> N2(nn2);
    for(long long i=0; i<nn2; i++) N2.at(i) = (i+1)*(i+1);
    for(int i=1; i<nn2; i++)  N2.at(i) += N2.at(i-1);

    long long R,B; cin >> R >> B;
    if(R > B) swap(R,B);
auto solve = [](long long R,long long B) -> long long {
    long long ans1 = -1,border = -1;
    for(long long i=1; ; i++){
        long long need = i*i;
        if(R >= need) R -= need;
        else if(B >= need){
            if(border == -1) border = i; 
            B -= need;
        }
        else{ans1 = i; break;}
    }
    for(long long i=border-1; i>=1; i--){
        long long need = i*i;
        if(B >= need) B -= need,R += need;
    }
    for(;; ans1++){
        long long need= ans1*ans1;
        if(R >= need) R -= need;
        else{ans1--; break;}
    }
    return ans1;
};
    
    long long check = max(solve(R,B),solve(B,R));

    long long n = 18,n2 = 1<<n;
    set<long long> Se;
    for(long long i=0; i<n2; i++){
        long long r = 0,b = 0;
        for(long long k=0; k<n; k++){
            if(i&(1<<k)) r += (k+1)*(k+1);
            else b += (k+1)*(k+1); 
        }
        Se.insert(r);
    }
    long long sum = R+B;
    auto itr = Se.end(); itr--;
    if(*itr < R){
        int ans = upper_bound(N2.begin(),N2.end(),sum)-N2.begin();
        cout << ans << endl;
        assert(ans >= check);
    }
    else{
        long long maxs = 0;
        itr = Se.upper_bound(R);
        itr--;
        maxs = *itr; sum = maxs+B;
        int ans = upper_bound(N2.begin(),N2.end(),sum)-N2.begin();
        cout << ans << endl;
    	assert(ans >= check);
    }
}