CF 214 A 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.

Input

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.

Output

On a single line print the answer to the problem.

Example

Input

9 3

Output

1

Input

14 28

Output

1

Input

4 20

Output

0

Note

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.

简单的暴力可过，注意a,b>=0。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 4000+5;
int N,M;
int main(){
	scanf("%d %d",&N,&M);
	int cnt = 0;
	for(int i = 0; i <= M; i++){
		if(M-i == (N-i*i)*(N-i*i)){
			if(N-i*i>=0)
				cnt++;
		}
	}
	printf("%d\n",cnt);
	return 0;
}