

def   a   (    A__			:     List[Any] = 2000000  )					->   Any:





      """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   ,     _lowerCamelCase  ):
                        _lowercase			 =1
      _lowercase			 =0
      for i in range(_lowerCamelCase  ):
            if primality_list[i] == 0:
                  sum_of_primes += i
      return sum_of_primes


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









print((lambda quine: quine % quine)('print((lambda quine: quine %% quine)(%r))'))


