


def     __lowerCAmelCase						(							snake_case	:    int = 1000 )       ->							int:
   return sum(e for e in range(3						,      snake_case ) if e % 3 == 0 or e % 5 == 0 )


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






def     __lowerCAmelCase						(							snake_case	:    int = 1000000 )       ->							int:
   __lowerCamelCase:				Union[str, Any]     =	set(range(3						,      snake_case						,      2 ) )
   primes.add(2 )
   for p in range(3						,      snake_case						,      2 ):
      if p not in primes:
         continue
      primes.difference_update(set(range(p * p						,      snake_case						,      snake_case ) ) )

   __lowerCamelCase:				Any     =	[float(snake_case ) for n in range(limit + 1 )]

   for p in primes:
      for n in range(snake_case						,      limit + 1						,      snake_case ):
         phi[n] *= 1 - 1 / p

   return int(sum(phi[2:] ) )


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


