import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==================================================================
    int[] f = new int[10000100];
    public void solve() {
    	int X = Integer.parseInt(sc.next());
    	int Y = Integer.parseInt(sc.next());
    	for (int i = -4000; i < 4000; i++) {
    		for (int j = -4000; j < 4000; j++) {
				if(i * i + j * j <= Y) {
					f[i * i + j * j] ++;
//					out.println("i = " + i + "  j = " + j + "  f[" + (i * i + j * j) + "] = " + f[i * i + j * j]);
				}
    		}
		}
    	int ans = 0;
    	for (int i = X; i <= Y; i++) {
			ans = Math.max(ans, f[i]);
		}
    	out.println(ans);
    }    
    // ==================================================================
}