#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int R1, R2;
int cnt[10000100];

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

    std::cin >> R1 >> R2;

    int mx = 0;
    for(int i=0;i<=5000;++i){
        for(int j=0;j<=5000;++j){
            int sum = i * i + j * j;
            if(R1 <= sum && sum <= R2){
                if(i == 0 || j == 0){
                    cnt[sum] += 2;
                }else{
                    cnt[sum] += 4;
                }

                mx = std::max(mx, cnt[sum]);
            }
        }
    }

    std::cout << mx << std::endl;
}