




def 							_A       (						):
     """simple docstring"""

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



def 							_A       (						lowerCAmelCase_					: List[str]      ):
     """simple docstring"""

     lowerCAmelCase__          =			1
     lowerCAmelCase__          =			2
     while i * i <= n:
          lowerCAmelCase__          =			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 							_A       (						):
     """simple docstring"""

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


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






from statistics import mean, stdev



def 							_A       (						lowerCAmelCase_					: list       ,    lowerCAmelCase_					: int = 3      ):
     """simple docstring"""

     lowerCAmelCase__          =			min(lowerCAmelCase_      )
     lowerCAmelCase__          =			max(lowerCAmelCase_      )
     # normalize data
     return [round((x - x_min) / (x_max - x_min)       ,    lowerCAmelCase_      ) for x in data]






def 							_A       (						lowerCAmelCase_					: list       ,    lowerCAmelCase_					: int = 3      ):
     """simple docstring"""

     lowerCAmelCase__          =			mean(lowerCAmelCase_      )
     lowerCAmelCase__          =			stdev(lowerCAmelCase_      )
     # standardize data
     return [round((x - mu) / (sigma)       ,    lowerCAmelCase_      ) for x in data]
