#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

const int MAXN = 1e7;
int f[MAXN+1];

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

  vector<int> sq;
  for (int i = 0; i * i <= MAXN; i++)
    sq.push_back(i * i);

  int n = sq.size();
  REP (i, n) REP (j, n) {
    if (sq[i] + sq[j] <= MAXN)
      f[sq[i] + sq[j]] += 1 << (sq[i] > 0) + (sq[j] > 0);
  }
  int x, y;
  cin >> x >> y;

  int ret = 0;
  for (int i = x; i <= y; i++)
    ret = max(ret, f[i]);

  cout << ret << endl;
  
  return 0;
}