"""simple docstring"""



from __future__ import annotations

import math





def    SCREAMING_SNAKE_CASE       (     snake_case):

     if 1 < number < 4:
          # 2 and 3 are primes
          return True
     elif number < 2 or number % 2 == 0 or number % 3 == 0:
          # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
          return False

     # All primes number are in format of 6k +/- 1
     for i in range(5,      int(math.sqrt(snake_case) + 1),      6):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True


__lowercase		:		Union[str, Any]														=							[num for num in range(3, 10_0001, 2) if not is_prime(num)]





def    SCREAMING_SNAKE_CASE       (     snake_case):
     if not isinstance(snake_case,      snake_case):
          raise ValueError('''n must be an integer''')
     if n <= 0:
          raise ValueError('''n must be >= 0''')

     __snake_case				=							[]
     for num in range(len(snake_case)):
          __snake_case				=							0
          while 2 * i * i <= odd_composites[num]:
               __snake_case				=							odd_composites[num] - 2 * i * i
               if is_prime(snake_case):
                    break
               i += 1
          else:
               list_nums.append(odd_composites[num])
               if len(snake_case) == n:
                    return list_nums

     return []





def    SCREAMING_SNAKE_CASE       (     ):
     return compute_nums(1)[0]


if __name__ == "__main__":
       print(F"""{solution() = }""")
"""simple docstring"""



import re





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


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