





def 			_SCREAMING_SNAKE_CASE    (       a = 10_00  )				->				int:
					__A     :						List[str]          =    0
					__A     :						Optional[int]          =    0
					while 1:
										num += 3
										if num >= n:
															break
										total += num
										num += 2
										if num >= n:
															break
										total += num
										num += 1
										if num >= n:
															break
										total += num
										num += 3
										if num >= n:
															break
										total += num
										num += 1
										if num >= n:
															break
										total += num
										num += 2
										if num >= n:
															break
										total += num
										num += 3
										if num >= n:
															break
										total += num
					return total


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











from .hash_table import HashTable





class 						_A( snake_case__       ):


				"""simple docstring"""


				def __init__(      self					, *_A					, **_A					):
									super().__init__(*_A					, **_A					)





				def  UpperCAmelCase_		(      self					, _A					, _A=None					):
									__A     :						Optional[int]          =    1
									__A     :						Union[str, Any]          =    self.hash_function(key + i * i					)

									while self.values[new_key] is not None and self.values[new_key] != key:
														i += 1
														__A     :						Tuple          =    (
														    self.hash_function(key + i * i					)
														    if not self.balanced_factor() >= self.lim_charge
														    else None
														)

														if new_key is None:
																			break

									return new_key




