
def 			UpperCamelCase					(    __lowerCamelCase     : int    ):
       snake_case       :   Optional[Any]							=      (1 + 24 * n) ** 0.5
       return ((1 + root) / 6) % 1 == 0


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

       return -1


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












'''simple docstring'''

from string import ascii_lowercase, ascii_uppercase





def lowerCamelCase						(     __lowerCamelCase :    str    )						->str:
    if not sentence:
        return ""
    _SCREAMING_SNAKE_CASE									=			dict(zip(__lowerCamelCase					,       __lowerCamelCase    )    )
    return lower_to_upper.get(sentence[0]					,       sentence[0]    ) + sentence[1:]


if __name__ == "__main__":
      from doctest import testmod

      testmod()



