


'''simple docstring'''






import re






def 	_A				(lowerCAmelCase__  :str		)   ->  int:




     '''simple docstring'''



     _a			      =							re.compile(r'^(\+91[\-\s]?)?[0]?(91)?[789]\d{9}$'		)
     if match := re.search(_SCREAMING_SNAKE_CASE				,						_SCREAMING_SNAKE_CASE		):
          return match.string == phone
     return False


if __name__ == "__main__":
 print(indian_phone_validator("+918827897895"))





'''simple docstring'''






class  a     :
 def __init__( self      ,				__magic_name__						)					->							Optional[int]:
      _a			      =							n
      _a			      =							[None] * self.n
      _a			      =							0  # index of the first element
      _a			      =							0
      _a			      =							0
 def __len__( self						)					->							int:
      return self.size
 def 							__UpperCAmelCase		( self						)					->							bool:
      return self.size == 0
 def 							__UpperCAmelCase		( self						)					->							Optional[Any]:
      return False if self.is_empty() else self.array[self.front]
 def 							__UpperCAmelCase		( self      ,				__magic_name__						)					->							Optional[Any]:
      if self.size >= self.n:
           raise Exception('QUEUE IS FULL'						)

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




 def 							__UpperCAmelCase		( self						)					->							Any:
      if self.size == 0:
           raise Exception('UNDERFLOW'						)

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

