






def 					snake_case	(  ):




	'''simple docstring'''







	for n in range(1					,	1_000_000       ):
		yield n * (n + 1) // 2





def 					snake_case	(  lowerCamelCase       ):




	'''simple docstring'''







	__lowercase   							=	1
	__lowercase   							=	2
	while i * i <= n:
		__lowercase   							=	0
		while n % i == 0:
			n //= i
			multiplicity += 1
		divisors_count *= multiplicity + 1
		i += 1
	if n > 1:
		divisors_count *= 2
	return divisors_count





def 					snake_case	(  ):




	'''simple docstring'''







	return next(i for i in triangle_number_generator() if count_divisors(lowerCamelCase       ) > 500       )


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







'''simple docstring'''


class  __lowercase    :  # Public class to implement a graph







   def __init__(						self   ,				UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )					->     None:
     __a								=       row
     __a								=       col
     __a								=       graph







   def 		UpperCamelCase__      (						self   ,				UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )					->     bool:
     return (
         0 <= i < self.ROW
         and 0 <= j < self.COL
         and not visited[i][j]
         and self.graph[i][j]
     )







   def 		UpperCamelCase__      (						self   ,				UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )					->     None:
     # Checking all 8 elements surrounding nth element
     __a								=       [-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
     __a								=       [-1, 0, 1, -1, 1, -1, 0, 1]
     __a								=       True  # Make those cells visited
     for k in range(8   ):
       if self.is_safe(i + row_nbr[k]   ,				j + col_nbr[k]   ,				UpperCamelCase   ):
         self.diffs(i + row_nbr[k]   ,				j + col_nbr[k]   ,				UpperCamelCase   )







   def 		UpperCamelCase__      (						self   )					->     int:  # And finally, count all islands.
     __a								=       [[False for j in range(self.COL   )] for i in range(self.ROW   )]
     __a								=       0
     for i in range(self.ROW   ):
       for j in range(self.COL   ):
         if visited[i][j] is False and self.graph[i][j] == 1:
           self.diffs(UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )
           count += 1
     return count



