import sys

def main():
    X, Y = map(int, sys.stdin.readline().split())
    max_R = Y
    # Precompute smallest prime factors
    spf = list(range(max_R + 1))
    for i in range(2, int(max_R**0.5) + 1):
        if spf[i] == i:
            for j in range(i*i, max_R + 1, i):
                if spf[j] == j:
                    spf[j] = i
    max_f = 0
    for R in range(X, Y + 1):
        current = R
        prod = 1
        valid = True
        while current > 1:
            p = spf[current]
            count = 0
            while current % p == 0:
                count += 1
                current = current // p
            if p % 4 == 3:
                if count % 2 != 0:
                    valid = False
                    break
            elif p % 4 == 1:
                prod *= (count + 1)
        if valid:
            current_f = prod * 4
            if current_f > max_f:
                max_f = current_f
    print(max_f)

if __name__ == "__main__":
    main()