


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() = }""")






def     __lowerCAmelCase						(							)       ->							Optional[Any]:
   __lowerCamelCase:				List[str]     =	[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

   __lowerCamelCase:				List[str]     =	6
   __lowerCamelCase:				Optional[int]     =	1
   __lowerCamelCase:				int     =	1901

   __lowerCamelCase:				Tuple     =	0

   while year < 2001:
      day += 7

      if (year % 4 == 0 and year % 100 != 0) or (year % 400 == 0):
         if day > days_per_month[month - 1] and month != 2:
            month += 1
            __lowerCamelCase:				Union[str, Any]     =	day - days_per_month[month - 2]
         elif day > 29 and month == 2:
            month += 1
            __lowerCamelCase:				List[Any]     =	day - 29
      else:
         if day > days_per_month[month - 1]:
            month += 1
            __lowerCamelCase:				Any     =	day - days_per_month[month - 2]

      if month > 12:
         year += 1
         __lowerCamelCase:				Dict     =	1

      if year < 2001 and day == 1:
         sundays += 1
   return sundays


if __name__ == "__main__":
   print(solution())


