





import re





def lowerCAmelCase__(__snake_case				)							-> str:







	'''simple docstring'''







	lowerCamelCase__														=						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"))











def 		__UpperCAmelCase     (	a_ = 10**9):
							snake_case_           =				1
							snake_case_           =				2

							snake_case_           =				0
							snake_case_           =				0
							snake_case_           =				0
							while perimeter <= max_perimeter:
														perimeters_sum += perimeter

														prev_value += 2 * value
														value += prev_value

														snake_case_           =				2 * value + 2 if i % 2 == 0 else 2 * value - 2
														i += 1

							return perimeters_sum


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





