




"""simple docstring"""







def 						snake_case__       (					_lowerCamelCase = 10**9				)			->int:






		"""simple docstring"""


		__lowercase				:		List[Any]												=				1
		__lowercase				:		Union[str, Any]												=				2

		__lowercase				:		Dict												=				0
		__lowercase				:		str												=				0
		__lowercase				:		Dict												=				0
		while perimeter <= max_perimeter:
				perimeters_sum += perimeter

				prev_value += 2 * value
				value += prev_value

				__lowercase				:		Tuple												=				2 * value + 2 if i % 2 == 0 else 2 * value - 2
				i += 1

		return perimeters_sum


if __name__ == "__main__":
						print(F"""{solution() = }""")






"""simple docstring"""







from collections import deque

from .hash_table import HashTable




class       lowerCAmelCase__       (			lowerCAmelCase_    ):


				"""simple docstring"""





				def __init__(     self					:	Optional[int]    ,   *lowercase__					:	Any    ,   **lowercase__					:	Union[str, Any]						):
						super().__init__(*lowercase__    ,   **lowercase__						)



				def       snake_case    (     self					:	Any    ,   lowercase__					:	Dict    ,   lowercase__					:	Dict						):
						__lowercase				:		Dict												=				deque([]						) if self.values[key] is None else self.values[key]
						self.values[key].appendleft(lowercase__						)
						__lowercase				:		Union[str, Any]												=				self.values[key]



				def       snake_case    (     self					:	str						):
						return (
						    sum(self.charge_factor - len(lowercase__						) for slot in self.values						)
						    / self.size_table
						    * self.charge_factor
						)



				def       snake_case    (     self					:	Union[str, Any]    ,   lowercase__					:	List[str]    ,   lowercase__					:	str=None						):
						if not (
						    len(self.values[key]						) == self.charge_factor and self.values.count(lowercase__						) == 0
						):
								return key
						return super()._collision_resolution(lowercase__    ,   lowercase__						)
