

'''simple docstring'''






def 	_A  (					A__ = 2000000   ):






 """simple docstring"""



 __lowercase													=				[0 for i in range(n + 1   )]
 __lowercase													=				1
 __lowercase													=				1

 for i in range(2  ,       int(n**0.5   ) + 1   ):
  if primality_list[i] == 0:
   for j in range(i * i  ,       n + 1  ,       A__   ):
    __lowercase													=				1
 __lowercase													=				0
 for i in range(A__   ):
  if primality_list[i] == 0:
   sum_of_primes += i
 return sum_of_primes


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





'''simple docstring'''






import re


def 	_A  (					A__   ):






 """simple docstring"""



 __lowercase													=				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(A__  ,       A__   )   )


if __name__ == "__main__":
 lowerCAmelCase__      		=			'''0094702343221'''

 print(is_sri_lankan_phone_number(phone))

