






'''simple docstring'''



def 							lowercase_				(    __A :       int					,      __A :       int			)       ->      int:



 """simple docstring"""




 while b:
  lowercase					:   Union[str, Any]				  =b, a % b
 return a


def 							lowercase_				(    __A :       int					,      __A :       int			)       ->      int:



 """simple docstring"""




 return a if b == 0 else euclidean_gcd_recursive(__A					,      a % b			)


def 							lowercase_				(    )       ->      Any:



 """simple docstring"""




 print(F'euclidean_gcd(3, 5) = {euclidean_gcd(3					,      5			)}'			)
 print(F'euclidean_gcd(5, 3) = {euclidean_gcd(5					,      3			)}'			)
 print(F'euclidean_gcd(1, 3) = {euclidean_gcd(1					,      3			)}'			)
 print(F'euclidean_gcd(3, 6) = {euclidean_gcd(3					,      6			)}'			)
 print(F'euclidean_gcd(6, 3) = {euclidean_gcd(6					,      3			)}'			)

 print(F'euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3					,      5			)}'			)
 print(F'euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5					,      3			)}'			)
 print(F'euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1					,      3			)}'			)
 print(F'euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3					,      6			)}'			)
 print(F'euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6					,      3			)}'			)


if __name__ == "__main__":
      main()











'''simple docstring'''



import re


def 							lowercase_				(    __A :       str			)       ->      bool:



 """simple docstring"""




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


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



