





from __future__ import annotations

from typing import Any






class    __A       :

			'''simple docstring'''







			def __init__(       self			,    __lowerCAmelCase = 6				):



				'''simple docstring'''







				lowerCamelCase__														=						None
				lowerCamelCase__														=						None
				self.create_linked_list(__lowerCAmelCase				)





			def 						__lowerCamelCase							(       self			,    __lowerCAmelCase				):



				'''simple docstring'''







				lowerCamelCase__														=						Node()
				lowerCamelCase__														=						current_node
				lowerCamelCase__														=						current_node
				lowerCamelCase__														=						current_node
				for _ in range(1			,    __lowerCAmelCase				):
					lowerCamelCase__														=						Node()
					lowerCamelCase__														=						current_node
					lowerCamelCase__														=						previous_node
					lowerCamelCase__														=						current_node
				lowerCamelCase__														=						self.front
				lowerCamelCase__														=						previous_node





			def 						__lowerCamelCase							(       self				):



				'''simple docstring'''







				return (
				    self.front == self.rear
				    and self.front is not None
				    and self.front.data is None
				)





			def 						__lowerCamelCase							(       self				):



				'''simple docstring'''







				self.check_can_perform_operation()
				return self.front.data if self.front else None





			def 						__lowerCamelCase							(       self			,    __lowerCAmelCase				):



				'''simple docstring'''







				if self.rear is None:
					return

				self.check_is_full()
				if not self.is_empty():
					lowerCamelCase__														=						self.rear.next
				if self.rear:
					lowerCamelCase__														=						data





			def 						__lowerCamelCase							(       self				):



				'''simple docstring'''







				self.check_can_perform_operation()
				if self.rear is None or self.front is None:
					return None
				if self.front == self.rear:
					lowerCamelCase__														=						self.front.data
					lowerCamelCase__														=						None
					return data

				lowerCamelCase__														=						self.front
				lowerCamelCase__														=						old_front.next
				lowerCamelCase__														=						old_front.data
				lowerCamelCase__														=						None
				return data





			def 						__lowerCamelCase							(       self				):



				'''simple docstring'''







				if self.is_empty():
					raise Exception('''Empty Queue'''				)





			def 						__lowerCamelCase							(       self				):



				'''simple docstring'''







				if self.rear and self.rear.next == self.front:
					raise Exception('''Full Queue'''				)






class    __A       :

			'''simple docstring'''







			def __init__(       self				):



				'''simple docstring'''







				lowerCamelCase__														=						None
				lowerCamelCase__														=						None
				lowerCamelCase__														=						None


if __name__ == "__main__":
			import doctest

			doctest.testmod()











def 		__UpperCAmelCase     (	a_ = 10**9):
							snake_case_           =				1
							snake_case_           =				2

							snake_case_           =				0
							snake_case_           =				0
							snake_case_           =				0
							while perimeter <= max_perimeter:
														perimeters_sum += perimeter

														prev_value += 2 * value
														value += prev_value

														snake_case_           =				2 * value + 2 if i % 2 == 0 else 2 * value - 2
														i += 1

							return perimeters_sum


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





