



'''simple docstring'''
class 							lowercase__	:





	def __init__( self					:				Dict ,lowerCamelCase__					:				int ):







							'''simple docstring'''
							_UpperCamelCase					:		Dict 				=   n
							_UpperCamelCase					:		Optional[int] 				=   [None] * self.n
							_UpperCamelCase					:		List[str] 				=   0  # index of the first element
							_UpperCamelCase					:		Dict 				=   0
							_UpperCamelCase					:		int 				=   0





	def __len__( self					:				Optional[int] ):







							'''simple docstring'''
							return self.size





	def 	UpperCamelCase_  ( self					:				Union[str, Any] ):







							'''simple docstring'''
							return self.size == 0





	def 	UpperCamelCase_  ( self					:				Union[str, Any] ):







							'''simple docstring'''
							return False if self.is_empty() else self.array[self.front]





	def 	UpperCamelCase_  ( self					:				Union[str, Any] ,lowerCamelCase__					:				Tuple ):







							'''simple docstring'''
							if self.size >= self.n:
													raise Exception('QUEUE IS FULL' )

							_UpperCamelCase					:		Optional[int] 				=   data
							_UpperCamelCase					:		Tuple 				=   (self.rear + 1) % self.n
							self.size += 1
							return self





	def 	UpperCamelCase_  ( self					:				Any ):







							'''simple docstring'''
							if self.size == 0:
													raise Exception('UNDERFLOW' )

							_UpperCamelCase					:		List[Any] 				=   self.array[self.front]
							_UpperCamelCase					:		Union[str, Any] 				=   None
							_UpperCamelCase					:		Optional[int] 				=   (self.front + 1) % self.n
							self.size -= 1
							return temp








def 		__A		(	__lowerCamelCase    )      ->       int:
	a										=							0
	while num > 0:
		digit_sum += num % 10
		num //= 10
	return digit_sum





def 		__A		(	__lowerCamelCase = 100    )      ->       int:
	a										=							1
	a										=							2

	for i in range(2							,			max_n + 1    ):
		a										=							pre_numerator
		a										=							2 * i // 3 if i % 3 == 0 else 1
		a										=							cur_numerator
		a										=							e_cont * pre_numerator + temp

	return sum_digits(__lowerCamelCase    )


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

