tprime_linear.d

import std.stdio;
import std.conv: parse;
import std.array: split, join;
import std.algorithm: map;
import std.string: chop;
import std.math: sqrt;

void main() {
    readln;
    readln.chop.split(" ").map!yesno.join("\n").writeln;
}
string yesno(string a) {
    auto n = sqrt(cast(real)a.parse!long);
    if(n == 1) return "NO";
    if(n % 1 == 0 && isPrime(cast(long)n)) return "YES";
    return "NO";
}
bool isPrime(long n) {
    foreach(i; 2..cast(long)sqrt(cast(real)n) + 1) if(n % i == 0) return false;
    return true;
}