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:
import sys
from math import sqrt

def isqrt(n):
  if n <= 0:
    return 0

  x = int(sqrt(n) * (1 + 1e-12))
  while True:
    y = (x + n // x) >> 1
    if y >= x:
      return x
    x = y

def solve():
  stdin = sys.stdin
  write = sys.stdout.write

  t = int(stdin.readline())
  for _ in range(t):
    D, P = map(int, stdin.readline().split())

    ans = set()

    if D >= 0:
      r = D * D + 4 * P
      if r >= 0:
        rt = isqrt(r)
        if rt * rt == r:
          num = -D + rt
          if not num & 1:
            b = num // 2
            a = D + b
            ans.add((a, b))
            b = (-D - rt) // 2
            a = D + b
            ans.add((a, b))

          num = D + rt
          if not num & 1:
            b = num // 2
            a = -D + b
            ans.add((a, b))
            b = (D - rt) // 2
            a = -D + b
            ans.add((a, b))
    write("%d\n" % len(ans))

solve()