from math import *

def isprime(n):
    m = floor(sqrt(n))
    i = 2
    while i < m:
        if n % i == 0: return False
        i = i + 1
    return True