ardnew wants to see my primes solution and help

primes.py

from math import floor, ceil, sqrt

p = int(input().strip())
for a0 in range(p):
    n = int(input().strip())
    
    if n == 1:
        print('Not prime')
        continue

    for d in range(2, int(sqrt(n))+1):
        if n % d == 0:
            print('Not prime')
            break
    else:
        print('Prime')