



'''simple docstring'''






def       lowerCamelCase__       (						):





  for n in range(1 ,			100_0000				):
    yield n * (n + 1) // 2
def       lowerCamelCase__       (						_A				):
  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__       (						):
  return next(i for i in triangle_number_generator() if count_divisors(UpperCAmelCase_				) > 500				)


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



from __future__ import annotations
def 				__lowerCamelCase						( UpperCAmelCase_						:		dict ,  UpperCAmelCase_						:		str						):




      """simple docstring"""





      a							,				a						:Optional[Any] 							=       set(UpperCAmelCase_						), [start]

      while stack:
            a						:Optional[int] 							=       stack.pop()
            explored.add(UpperCAmelCase_						)
            # Differences from BFS:
            # 1) pop last element instead of first one
            # 2) add adjacent elements to stack without exploring them
            for adj in reversed(graph[v]						):
                  if adj not in explored:
                        stack.append(UpperCAmelCase_						)
      return explored


snake_case				:    Optional[int]       				=     {
    '''A''': ['''B''', '''C''', '''D'''],
    '''B''': ['''A''', '''D''', '''E'''],
    '''C''': ['''A''', '''F'''],
    '''D''': ['''B''', '''D'''],
    '''E''': ['''B''', '''F'''],
    '''F''': ['''C''', '''E''', '''G'''],
    '''G''': ['''F'''],
}

if __name__ == "__main__":
     import doctest

     doctest.testmod()
     print(depth_first_search(G, '''A'''))





