?
def isPrime(n): if n>1: if n%2 == 0 and n<2: return False else: for i in range(3,((int(n**0.5))+1),2): if n%i == 0: return False return True n = int(raw_input()) x = map(int,raw_input().split()) for i in x: raiz = int((i**0.5)) if isPrime(raiz) and raiz**2 == i: print "Yes" else: print "No"
?
?
?
?