def small_nnum(list1,n):
  import heapq
  
  smallest=heapq.nsmallest(n,list1)
  return smallest
def is_not_prime(n):
    import math
    
    result = False
    for i in range(2,int(math.sqrt(n)) + 1):
        if n % i == 0:
            result = True
    return result