#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define out(a) cout << a << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)

int cnt[(int)1e7 + 1]; // 半径の2乗R上の格子点の数
int main() {
    int x, y; cin >> x >> y; // 半径の2乗Rの最小値、最大値
    
    int r = 0; // 半径の最大が√y
    while (r * r <= y) r++; r--;
    
    
    rep(i, r + 1) {
        rep3(j, 1, r + 1) {
            cnt[i * i + j * j]++;
        }
    }
    int ans = 0;
    rep3(i, x, y + 1) chmax(ans, cnt[i]);
    out(4 * ans);
}