'''simple docstring'''


def  _lowerCamelCase   (				lowerCamelCase_ :							int       ):



     """simple docstring"""





     UpperCAmelCase_							:       Union[str, Any]       =				(1 + 24 * n) ** 0.5
     return ((1 + root) / 6) % 1 == 0


def  _lowerCamelCase   (				lowerCamelCase_ :							int = 5000       ):



     """simple docstring"""





     UpperCAmelCase_							:       int       =				[(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_       )       ):
               UpperCAmelCase_							:       Any       =				pentagonal_nums[j]
               UpperCAmelCase_							:       int       =				pentagonal_i + pentagonal_j
               UpperCAmelCase_							:       Union[str, 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'''


snake_case__					:      str				      =  '''Tobias Carryer'''

from time import time






class 					__SCREAMING_SNAKE_CASE						:







  '''simple docstring'''






  def __init__(			self				,		snake_case_				,		snake_case_				,		snake_case_				,		snake_case_=int(time()						)						):  # noqa: B008




       '''simple docstring'''

       UpperCAmelCase_							:       str       =				multiplier
       UpperCAmelCase_							:       Dict       =				increment
       UpperCAmelCase_							:       Tuple       =				modulo
       UpperCAmelCase_							:       Dict       =				seed






  def _UpperCamelCase					(			self						):




       '''simple docstring'''

       UpperCAmelCase_							:       Union[str, Any]       =				(self.multiplier * self.seed + self.increment) % self.modulo
       return self.seed


if __name__ == "__main__":
 # Show the LCG in action.
 snake_case__					:      Any				      =  LinearCongruentialGenerator(166_4525, 10_1390_4223, 2 << 31)
 while True:
  print(lcg.next_number())






