from math import gcd
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
U = 5 * 10 ** 6


def prime_sieve(N):
    #sieve[i] : iの最小の素因数
    sieve = [0] * (N + 1)
    prime = []
    for i in range(2, N + 1):
        if sieve[i] == 0:
            sieve[i] = i
            prime.append(i)
        for p in prime:
            if p > sieve[i] or i * p > N:
                break
            sieve[i * p] = p
    return sieve


sieve = prime_sieve(U)


T = int(input())
for _ in range(T):
    a, p = map(int, input().split())
    if p == 1 or sieve[p] != p:
        print(-1)
    elif gcd(a, p) == 1:
        print(1)
    else:
        print(0)