






def 	_UpperCamelCase   (    UpperCamelCase_       :					Dict		)  ->   int:

						"""simple docstring"""



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







def 	_UpperCamelCase   (    )  ->   Dict:

						"""simple docstring"""



						lowerCAmelCase__    						=						1
						lowerCAmelCase__    						=						1

						while True:
												i += 1
												t_num += i

												if count_divisors(UpperCamelCase_		) > 500:
																		break

						return t_num


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













from collections import deque

from .hash_table import HashTable


class     __SCREAMING_SNAKE_CASE					(   __lowercase):






						def __init__(	self     ,						*_UpperCamelCase     ,						**_UpperCamelCase   ):






												"""simple docstring"""
												super().__init__(*_UpperCamelCase     ,						**_UpperCamelCase   )






						def       UpperCamelCase__      (	self     ,						_UpperCamelCase     ,						_UpperCamelCase   ):






												"""simple docstring"""
												lowerCAmelCase__    						=						deque([]   ) if self.values[key] is None else self.values[key]
												self.values[key].appendleft(_UpperCamelCase   )
												lowerCAmelCase__    						=						self.values[key]






						def       UpperCamelCase__      (	self   ):






												"""simple docstring"""
												return (
												    sum(self.charge_factor - len(_UpperCamelCase   ) for slot in self.values   )
												    / self.size_table
												    * self.charge_factor
												)







						def       UpperCamelCase__      (	self     ,						_UpperCamelCase     ,						_UpperCamelCase=None   ):






												"""simple docstring"""
												if not (
												    len(self.values[key]   ) == self.charge_factor and self.values.count(_UpperCamelCase   ) == 0
												):
																		return key
												return super()._collision_resolution(_UpperCamelCase     ,						_UpperCamelCase   )





