



import re

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


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










"""simple docstring"""


def 			_lowerCAmelCase				(       ):
						for n in range(1		,     1000000						):
												yield n * (n + 1) // 2

def 			_lowerCAmelCase				(       lowercase_						):
						UpperCAmelCase					=			1
						UpperCAmelCase					=			2
						while i * i <= n:
												UpperCAmelCase					=			0
												while n % i == 0:
																		n //= i
																		multiplicity += 1
												divisors_count *= multiplicity + 1
												i += 1
						if n > 1:
												divisors_count *= 2
						return divisors_count

def 			_lowerCAmelCase				(       ):
						return next(i for i in triangle_number_generator() if count_divisors(lowercase_						) > 500						)


if __name__ == "__main__":
				print(solution())





