def     lowerCAmelCase_			(   _SCREAMING_SNAKE_CASE     :				int			):
						UpperCamelCase_		:							Dict  =		(1 + 24 * n) ** 0.5
						return ((1 + root) / 6) % 1 == 0






def     lowerCAmelCase_			(   _SCREAMING_SNAKE_CASE     :				int = 5000			):
						UpperCamelCase_		:							List[Any]  =		[(i * (3 * i - 1)) // 2 for i in range(1		, _SCREAMING_SNAKE_CASE			)]
						for i, pentagonal_i in enumerate(_SCREAMING_SNAKE_CASE			):
												for j in range(_SCREAMING_SNAKE_CASE		, len(_SCREAMING_SNAKE_CASE			)			):
																		UpperCamelCase_		:							Optional[Any]  =		pentagonal_nums[j]
																		UpperCamelCase_		:							Optional[Any]  =		pentagonal_i + pentagonal_j
																		UpperCamelCase_		:							Any  =		pentagonal_j - pentagonal_i
																		if is_pentagonal(_SCREAMING_SNAKE_CASE			) and is_pentagonal(_SCREAMING_SNAKE_CASE			):
																								return b

						return -1


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








"""simple docstring"""




from math import ceil



def     __magic_name__		(					UpperCamelCase     :		int = 1001     )     ->						int:
    a__		=			1

    for i in range(1							,		int(ceil(n / 2.0     )     )     ):
        a__		=			2 * i + 1
        a__		=			2 * i
        a__		=			total + 4 * odd**2 - 6 * even

    return total


if __name__ == "__main__":
    import sys

    if len(sys.argv) == 1:
        print(solution())
    else:
        try:
            a		:       Any     						=       int(sys.argv[1])
            print(solution(n))
        except ValueError:
            print('Invalid entry - please enter a number')


