def square_Sum(n):
      
    return int(2*n*(n+1)*(2*n+1)/3)
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