CF214A.System of Equations

Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to get a good mark for math. For that Ms. Ivanova, his math teacher, gave him a new task. Furik solved the task immediately. Can you?

You are given a system of equations:

You should count, how many there are pairs of integers (a, b) (0 ≤ a, b) which satisfy the system.

弗里克非常喜欢数学课，因此他不像鲁比克那样去上课。但现在弗里克想在数学上取得一个好成绩。为此，他的数学老师伊万诺娃女士给他布置了一道新题目。弗里克立刻解出了这道题。你行吗？

给定如下方程组：

你需要计算满足该方程组的整数对 $(a,\,b)$（其中 $0\le a,\,b$）的个数。

A single line contains two integers n, m (1 ≤ n, m ≤ 1000) — the parameters of the system. The numbers on the line are separated by a space.

一行包含两个整数 $n$ 和 $m$（$1 \leq n, m \leq 1000$）——系统的参数。行上的数字以空格分隔。

On a single line print the answer to the problem.

在一行中输出问题的答案。

In the first sample the suitable pair is integers (3, 0). In the second sample the suitable pair is integers (3, 5). In the third sample there is no suitable pair.

在第一个样例中，合适的数对是整数 $(3,\,0)$。在第二个样例中，合适的数对是整数 $(3,\,5)$。在第三个样例中，不存在合适的数对。