import sys, time, random
from collections import deque, Counter, defaultdict
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 61 - 1
mod = 998244353

from math import gcd
def isprime(n):
    if n <= 2:
        return n == 2
    if n % 2 == 0:
        return False
    s = 0
    t = n - 1
    while t % 2 == 0:
        s += 1
        t //= 2
    
    for a in [2,325,9375]:
        if a >= n:
            break
        x = pow(a, t, n)
        if x == 1 or x == n - 1:
            continue
        for _ in range(s):
            x = (x * x) % n
            if x == n - 1:
                break
        if x == n - 1:
            continue

        return False
    return True

for _ in range(ii()):
    n =ii()
    N = n ** 4 + 4
    p = isprime(N)
    print('Yes' if p else 'No')
    if p:
        print(0)
    else:
        N = str(N)
        cnt = 0
        for i in range(1, len(N) + 1):
            if N[-i] == '0':
                cnt += 1
            else:
                break
        print(cnt)