def isprime(n):
	if n <= 1: return False
	if n <= 3: return True
	if n & 1 == 0: return False
	if n < 4759123141:
		check = [2, 7, 61]
	else:
		check = [2, 325, 9375, 28178, 450775, 9780504, 1795265022]
	d, s = n - 1, 0
	while d % 2 == 0:
		d >>= 1
		s += 1
	for a in check:
		if n <= a:
			return True
		a = pow(a, d, n)
		if a == 1:
			continue
		r = 1
		while a != n - 1:
			if r == s:
				return False
			a = a * a % n
			r += 1
	return True

# (n^2-2n+2)(n^2+2n+2)

def fct(n):
	if (n*n-2*n+2 == 1 and isprime(n*n+2*n+2)) or (n*n+2*n+2 == 1 and isprime(n*n-2*n+2)):
		return 1
	return 0

def fct2(n):
	m = n**4 + 4
	ret = 0
	while m % 10 == 0:
		m //= 10
		ret += 1
	return ret

T = int(input())
for _ in range(T):
	n = int(input())
	if fct(n):
		print("Yes")
	else:
		print("No")
	print(fct2(n))