





'''simple docstring'''


class  lowerCAmelCase_		:




 def __init__(						self      ,  _lowerCAmelCase		)     ->				Optional[int]:
     _lowerCAmelCase						      =   n
     _lowerCAmelCase						      =   [None] * self.n
     _lowerCAmelCase						      =   0  # index of the first element
     _lowerCAmelCase						      =   0
     _lowerCAmelCase						      =   0




 def __len__(						self		)     ->				int:
     return self.size




 def 				_snake_case (						self		)     ->				bool:
     return self.size == 0




 def 				_snake_case (						self		)     ->				Union[str, Any]:
     return False if self.is_empty() else self.array[self.front]




 def 				_snake_case (						self      ,  _lowerCAmelCase		)     ->				Union[str, Any]:
     if self.size >= self.n:
         raise Exception("QUEUE IS FULL"		)

     _lowerCAmelCase						      =   data
     _lowerCAmelCase						      =   (self.rear + 1) % self.n
     self.size += 1
     return self





 def 				_snake_case (						self		)     ->				int:
     if self.size == 0:
         raise Exception("UNDERFLOW"		)

     _lowerCAmelCase						      =   self.array[self.front]
     _lowerCAmelCase						      =   None
     _lowerCAmelCase						      =   (self.front + 1) % self.n
     self.size -= 1
     return temp









'''simple docstring'''


def 						__a(SCREAMING_SNAKE_CASE_	:       int		,							SCREAMING_SNAKE_CASE_	:       int     ):



    '''simple docstring'''





    return numa ^ numa < 0


if __name__ == "__main__":
       import doctest

       doctest.testmod()


