


def   _UpperCamelCase				(						lowerCAmelCase_ = 2_0_0_0_0_0_0   )						->int:
   UpperCAmelCase							=     [0 for i in range(n + 1   )]
   UpperCAmelCase							=     1
   UpperCAmelCase							=     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_   ):
            UpperCAmelCase							=     1
   UpperCAmelCase							=     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() = }""")







from math import sqrt
def   _UpperCamelCase				(						lowerCAmelCase_ = 1_0_0_0_0_0_0   )						->int:
   UpperCAmelCase							=     0
   UpperCAmelCase							=     0
   UpperCAmelCase							=     42

   while num_cuboids <= limit:
      max_cuboid_size += 1
      for sum_shortest_sides in range(2  ,						2 * max_cuboid_size + 1   ):
         if sqrt(sum_shortest_sides**2 + max_cuboid_size**2   ).is_integer():
            num_cuboids += (
                min(lowerCAmelCase_  ,						sum_shortest_sides // 2   )
                - max(1  ,						sum_shortest_sides - max_cuboid_size   )
                + 1
            )

   return max_cuboid_size


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



