#include <iostream>
using namespace std;
long long const S = 1000001;
long long p[S];
bool fres = false;
bool tres = true;
int input;
bool isPrime(long long N) {
for (int i = 0; i < S; i++) {
p[i] = fres;
}
for (int i = 2; i * i <= S; i++) {
if (p[i] == fres) {
for (int j = i * i; j <= S; j += i) {
p[j] == tres;
}
}
}
if (p[input] == fres) {
return fres;
}
else {
return tres;
}
}
int main() {
int T;
long long N;
cin >> T;
isPrime(N);
while (T) {
cin >> input;
if (p[input] == fres) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
T--;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKbG9uZyBsb25nIGNvbnN0IFMgPSAxMDAwMDAxOwpsb25nIGxvbmcgcFtTXTsKYm9vbCBmcmVzID0gZmFsc2U7CmJvb2wgdHJlcyA9IHRydWU7CmludCBpbnB1dDsKYm9vbCBpc1ByaW1lKGxvbmcgbG9uZyBOKSB7Cglmb3IgKGludCBpID0gMDsgaSA8IFM7IGkrKykgewoJCXBbaV0gPSBmcmVzOwoJfQoJZm9yIChpbnQgaSA9IDI7IGkgKiBpIDw9IFM7IGkrKykgewoJCWlmIChwW2ldID09IGZyZXMpIHsKCQkJZm9yIChpbnQgaiA9IGkgKiBpOyBqIDw9IFM7IGogKz0gaSkgewoJCQkJcFtqXSA9PSB0cmVzOwoJCQl9CgkJfQoJfQoJaWYgKHBbaW5wdXRdID09IGZyZXMpIHsKCQlyZXR1cm4gZnJlczsKCX0KCWVsc2UgewoJCXJldHVybiB0cmVzOwoJfQp9CmludCBtYWluKCkgewoJaW50IFQ7Cglsb25nIGxvbmcgTjsKCWNpbiA+PiBUOwoJaXNQcmltZShOKTsKCQl3aGlsZSAoVCkgewoJCQljaW4gPj4gaW5wdXQ7CgkJCWlmIChwW2lucHV0XSA9PSBmcmVzKSB7CgkJCQljb3V0IDw8ICJZRVMiIDw8IGVuZGw7CgkJCX0KCQkJZWxzZSB7CgkJCQljb3V0IDw8ICJOTyIgPDwgZW5kbDsKCQkJfQoJCQlULS07CgkJfQoJcmV0dXJuIDA7Cn0=