#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;


int A[(int)1e7] = {0};

int main() {

    int X,Y;
    cin >> X >> Y;

    for ( int i = 0; i <= sqrt(1e7); i++ ) {
    for ( int j = 1; j <= sqrt(1e7); j++ ) {
        if ( i*i + j*j > 1e7 ) { break; }
        A[ i*i + j*j ]++;
    }
    }

    int ans = 0;

    for ( int i = X; i <= Y; i++ ) {
        ans = max( ans, A[i]*4 );
    }

    cout << ans << endl;

    return 0;
}