题解 | #牛牛的素数判断#

def isPrime(n):
    for i in range(2, n):
        if n % i == 0:
            print('false')
            break
    else:
        print('true')
n = int(input())
for i in range(n):
    m = int(input())
    isPrime(m)