"""simple docstring"""



import os

# Precomputes a list of the 100 first triangular numbers
__lowercase		:		int														=							[int(0.5 * n * (n + 1)) for n in range(1, 101)]





def    SCREAMING_SNAKE_CASE       (     ):
     __snake_case				=							os.path.dirname(os.path.realpath(snake_case))
     __snake_case				=							os.path.join(snake_case,      '''words.txt''')

     __snake_case				=							''''''
     with open(snake_case) as f:
          __snake_case				=							f.readline()

     __snake_case				=							[word.strip('''"''') for word in words.strip('''\r\n''').split(''',''')]
     __snake_case				=							[
         word
         for word in [sum(ord(snake_case) - 64 for x in word) for word in words]
         if word in TRIANGULAR_NUMBERS
     ]
     return len(snake_case)


if __name__ == "__main__":
       print(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"))