
def 				a						(							snake_case__:					int						,   snake_case__:					int					):


				'''simple docstring'''
				return number | (1 << position)




def 				a						(							snake_case__:					int						,   snake_case__:					int					):


				'''simple docstring'''
				return number & ~(1 << position)




def 				a						(							snake_case__:					int						,   snake_case__:					int					):


				'''simple docstring'''
				return number ^ (1 << position)




def 				a						(							snake_case__:					int						,   snake_case__:					int					):


				'''simple docstring'''
				return ((number >> position) & 1) == 1




def 				a						(							snake_case__:					int						,   snake_case__:					int					):


				'''simple docstring'''
				return int((number & (1 << position)) != 0					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()








def 	lowerCAmelCase       (						lowerCAmelCase_ = 10**9       )->       int:
				lowerCAmelCase_       :					List[Any]			 = 1
				lowerCAmelCase_       :					Optional[int]			 = 2

				lowerCAmelCase_       :					Any			 = 0
				lowerCAmelCase_       :					str			 = 0
				lowerCAmelCase_       :					str			 = 0
				while perimeter <= max_perimeter:
								perimeters_sum += perimeter

								prev_value += 2 * value
								value += prev_value

								lowerCAmelCase_       :					Any			 = 2 * value + 2 if i % 2 == 0 else 2 * value - 2
								i += 1

				return perimeters_sum


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