def count_digits(num1,num2):
    
    number=num1+num2
    count = 0
    while(number > 0):
        number = number // 10
        count = count + 1
    return count
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