






'''simple docstring'''







def 			SCREAMING_SNAKE_CASE_	()				->	int:
							for n in range(1    ,      1000000				):
														yield n * (n + 1) // 2





def 			SCREAMING_SNAKE_CASE_	(UpperCamelCase				)				->	List[Any]:
							lowerCamelCase__ :     Tuple	  =	1
							lowerCamelCase__ :     Union[str, Any]	  =	2
							while i * i <= n:
														lowerCamelCase__ :     List[str]	  =	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 			SCREAMING_SNAKE_CASE_	()				->	Any:
							return next(i for i in triangle_number_generator() if count_divisors(UpperCamelCase				) > 500				)


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









'''simple docstring'''







from torch import nn





def 			SCREAMING_SNAKE_CASE_	(UpperCamelCase				)				->	Dict:
							if act_fn in ["swish", "silu"]:
														return nn.SiLU()
							elif act_fn == "mish":
														return nn.Mish()
							elif act_fn == "gelu":
														return nn.GELU()
							else:
														raise ValueError(f'''Unsupported activation function: {act_fn}'''				)

