Problem: Tim likes Math. He likes it so much that he always brings his tablets with him and reads math e-books everywhere, even during parties.

Tim found an interesting exercise in one of the e-books he is reading. But you want him to join the party, so you decide to answer the question for him.

The problem is: Given D and P, how many ordered pairs of integers are there whose absolute difference is D and whose product is P? In other words, how many pairs of integers (A,B) are there such that:

|A−B|=D
A×B=P

SAMPLE INPUT
3
1 2
0 4
-1 1

SAMPLE OUTPUT
4
2
0

Solution (in PYTHON):

Solution:
from math import sqrt
n=int(raw_input())
for j in range(n):
	d,p=map(float,raw_input().split())
	x=sqrt(d**2+4*p)
	z1=(x+d)/2
	z2=(x-d)/2
	if z1==int(z1) and z2==int(z2):
		b=p/z1
		if b!=z1:
			print 4
		else:
			print 2
	else:
		print 0