Time Complexity: Primality

#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the primality function below.
def primality(n):
    if n==1:
        return 'Not prime'
    if n==2:
        return 'Prime'
    
    for i in range(2,int(math.sqrt(n))+1):
        print(i)
        if n%i==0:
            return 'Not prime'
    return 'Prime'


if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    p = int(input())

    for p_itr in range(p):
        n = int(input())

        result = primality(n)

        fptr.write(result + '\n')

    fptr.close()