import sequtils,strutils,algorithm,math,sugar,macros,strformat
import sets,tables,intsets,queues,heapqueue,bitops
template get*():string = stdin.readLine().strip()
macro unpack*(arr: auto,cnt: static[int]): auto =
  let t = genSym(); result = quote do:(let `t` = `arr`;())
  for i in 0..<cnt: result[1].add(quote do:`t`[`i`])
template times*(n:int,body) = (for _ in 0..<n: body)
proc toCountSeq[T](x:seq[T]) : seq[tuple[k:T,v:int]] = toSeq(x.toCountTable().pairs)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)
proc sqrt(x:int):int = x.float.sqrt.int

let (x,y) = get().split().map(parseInt).unpack(2)
var results : array[1000_0010,int]
for a in 0..1000_0000.sqrt:
  for b in a..1000_0000.sqrt:
    var c = a * a + b * b
    if c > 1000_0000: break
    results[c] += (if a == 0 or a == b: 4 else: 8)

var ans = 0
for r in x..y: ans .max= results[r]
echo ans