


def 							_UpperCAmelCase    (UpperCamelCase__					:  str						):
       return n * (2 * n - 1)
def 							_UpperCAmelCase    (UpperCamelCase__					:  Optional[Any]						):
       _A				:	Optional[int]       =			(1 + 24 * n) ** 0.5
       return ((1 + root) / 6) % 1 == 0
def 							_UpperCAmelCase    (UpperCamelCase__					:  str = 144						):
       _A				:	List[str]       =			start
       _A				:	List[Any]       =			hexagonal_num(UpperCamelCase__						)
       while not is_pentagonal(UpperCamelCase__						):
              n += 1
              _A				:	Optional[int]       =			hexagonal_num(UpperCamelCase__						)
       return num


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




from itertools import permutations
def 							_UpperCAmelCase    ():
       _A				:	List[Any]       =			list(map("".join    ,							permutations("0123456789"						)						)						)
       return result[999999]


if __name__ == "__main__":
    print(solution())
