#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[10000001] = {0};

int main() {

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

    vector<int> V;

    for ( int i = 0; i < 10000; i++ ) {
        if ( i*i < 10000001 ) { V.push_back(i*i); }
    }
    
    for ( int i = 0; i < V.size(); i++ ) {
    for ( int j = 1; j < V.size(); j++ ) {
        if ( V[i]+V[j] < 10000001  ) { A[ V[i]+V[j] ]++; }
    }
    }

    int ans = 0;

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

    cout << ans << endl;

    return 0;
}