




def 							__lowerCAmelCase			(UpperCAmelCase_ = 4_000_000		):
    a__  			=							1
    a__  			=							2
    a__  			=							0
    while j <= n:
        if j % 2 == 0:
            total += j
        a__			,		a__  			=							j, i + j

    return total


if __name__ == "__main__":
 print(F"{solution() = }")












def 							__lowerCAmelCase			(UpperCAmelCase_		):
    return n * (2 * n - 1)
def 							__lowerCAmelCase			(UpperCAmelCase_		):
    a__  			=							(1 + 24 * n) ** 0.5
    return ((1 + root) / 6) % 1 == 0
def 							__lowerCAmelCase			(UpperCAmelCase_ = 144		):
    a__  			=							start
    a__  			=							hexagonal_num(UpperCAmelCase_		)
    while not is_pentagonal(UpperCAmelCase_		):
        n += 1
        a__  			=							hexagonal_num(UpperCAmelCase_		)
    return num


if __name__ == "__main__":
 print(F"{solution()} = ")






