#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
bool isPrime(long long num) {
    if (num <= 1) return false;
    if (num == 2 || num == 3) return true;
    if (num % 2 == 0 || num % 3 == 0) return false;
    for (long long i = 5; i * i <= num; i += 6) {
        if (num % i == 0 || num % (i + 2) == 0) return false;
    }
    return true;
}
int countDivisibilityBy10(long long num) {
    int count = 0;
    while (num % 10 == 0) {
        num /= 10;
        count++;
    }
    return count;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    vector<long long> N(T);
    for (int i = 0; i < T; ++i) {
        cin >> N[i];
    }
    for (int i = 0; i < T; ++i) {
        long long value = pow(N[i], 4) + 4;
        if (isPrime(value)) {
            cout << "Yes" <<'\n';
        } else {
            cout << "No" <<'\n';
        }
        cout << countDivisibilityBy10(value) <<'\n';
    }

    return 0;
}