


def 				__lowerCamelCase						( ):




      """simple docstring"""





      for n in range(1 ,  100_0000						):
            yield n * (n + 1) // 2
def 				__lowerCamelCase						( UpperCAmelCase_						:		List[Any]						):




      """simple docstring"""





      a						:List[str] 							=       1
      a						:List[str] 							=       2
      while i * i <= n:
            a						:int 							=       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 				__lowerCamelCase						( ):




      """simple docstring"""





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


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







def        a_		(       __lowercase   :	str ) ->  int:
			_snake_case		=			hex_num.strip()
			if not hex_num:
						raise ValueError('No value was passed to the function' )

			_snake_case		=			hex_num[0] == '-'
			if is_negative:
						_snake_case		=			hex_num[1:]

			try:
						_snake_case		=			int(__lowercase       ,					16 )
			except ValueError:
						raise ValueError('Invalid value was passed to the function' )

			_snake_case		=			''
			while int_num > 0:
						_snake_case		=			str(int_num % 2 ) + bin_str
						int_num >>= 1

			return int(('-' + bin_str) if is_negative else bin_str )


if __name__ == "__main__":
			import doctest

			doctest.testmod()