


"""simple docstring"""






def       A_   (   _lowerCAmelCase     :					int = 2_00_00_00       ):






     """simple docstring"""

     _a    	=				[0 for i in range(n + 1       )]
     _a    	=				1
     _a    	=				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       ):
                    _a    	=				1
     _a    	=				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() = }')



"""simple docstring"""






def       A_   (   _lowerCAmelCase     :					int = 10**12       ):






     """simple docstring"""

     _a    	=				1
     _a    	=				0

     _a    	=				1
     _a    	=				1

     while numerator <= 2 * min_total - 1:
          prev_numerator += 2 * numerator
          numerator += 2 * prev_numerator

          prev_denominator += 2 * denominator
          denominator += 2 * prev_denominator

     return (denominator + 1) // 2


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