<filename>HackerRank 30 Days of Code/025. Running Time and Complexity.py
# Running Time and Complexity

def find_prime(n):
    if n == 1:
        return 'Not prime'
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return 'Not prime'
       
    return 'Prime'


t = int(input())
for i in range(t):
    n = int(input())
    print(find_prime(n))

<filename>HackerRank 30 Days of Code/025. Running Time and Complexity.py
# Running Time and Complexity

def find_prime(n):
    if n == 1:
        return 'Not prime'
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return 'Not prime'
       
    return 'Prime'


t = int(input())
for i in range(t):
    n = int(input())
    print(find_prime(n))

# Running Time and Complexity