def sum_digits(n):
  
  if n == 0:
    return 0
  else:
    return n % 10 + sum_digits(int(n / 10))
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