



def 	_lowerCAmelCase (    A__ = 2_000_000						):
      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() = }''')





def 	_lowerCAmelCase (    A__ = 600_851_475_143						):

      try:
            lowercase__  =	int(A__						)
      except (TypeError, ValueError):
            raise TypeError('Parameter n must be int or castable to int.'						)
      if n <= 0:
            raise ValueError('Parameter n must be greater than or equal to one.'						)
      lowercase__  =	2
      lowercase__  =	0
      if n == 2:
            return 2
      while n > 2:
            while n % i != 0:
                  i += 1
            lowercase__  =	i
            while n % i == 0:
                  lowercase__  =	n // i
            i += 1
      return int(A__						)


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