浙大版《Python 程序设计》题目集 第4章-11 判断素数 (20分)

def isprime(n):
    if n == 1:
        return False
    else:
        for i in range(2,n):
            if n%i==0:
                return False
        else:
            return True

n = int(input())
li = []
for i in range(n):
    a = int(input())
    li.append(a)
for each in li:
    if isprime(each):
        print('Yes')
    else:
        print('No')