




import re



def       UpperCAmelCase__  (     lowerCamelCase   ):
  lowercase    :Any      	=						re.compile(
      r"^(?:0|94|\+94|0{2}94)" r"7(0|1|2|4|5|6|7|8)" r"(-| |)" r"\d{7}$"   )

  return bool(re.search(lowerCamelCase,			lowerCamelCase   )   )


if __name__ == "__main__":
     _UpperCAmelCase	:						Optional[int]			=     "0094702343221"

     print(is_sri_lankan_phone_number(phone))









def       UpperCAmelCase__  (     lowerCamelCase   ):
  return 10 - x * x



def       UpperCAmelCase__  (     lowerCamelCase,			lowerCamelCase   ):
  # Bolzano theory in order to find if there is a root between a and b
  if equation(lowerCamelCase   ) * equation(lowerCamelCase   ) >= 0:
    raise ValueError("Wrong space!"   )

  lowercase    :Optional[int]      	=						a
  while (b - a) >= 0.01:
    # Find middle point
    lowercase    :Optional[Any]      	=						(a + b) / 2
    # Check if middle point is root
    if equation(lowerCamelCase   ) == 0.0:
      break
    # Decide the side to repeat the steps
    if equation(lowerCamelCase   ) * equation(lowerCamelCase   ) < 0:
      lowercase    :Any      	=						c
    else:
      lowercase    :List[Any]      	=						c
  return c


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     print(bisection(-2, 5))
     print(bisection(0, 6))



