def first_Digit(n) :
      
    while n >= 10:  
        n = n / 10; 
    return int(n) 
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