from collections import defaultdict,Counter,deque
from heapq import heappush,heappop


# n以下のすべての素数を列挙する
def eratosthenes_sieve(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = is_prime[1] = False
    primes = set()
    for p in range(2, n + 1):
        if is_prime[p]:
            primes.add(p)
            for q in range(p * p, n + 1, p):
                is_prime[q] = False
    return sorted(list(primes))


def main():
    T = int(input())
    for _ in range(T):
        n = int(input())
        if abs(n) == 1:
            print("Yes")
            print(0)
        else:
            print("No")
            n = pow(n,4) + 4
            ok = 0
            ng = 100
            while ng - ok > 1:
                mid = (ok + ng)//2
                if n % pow(10,mid) == 0:
                    ok = mid
                else:
                    ng = mid
            print(ok)
        
    
    



if __name__ == '__main__':
    main()