




SCREAMING_SNAKE_CASE:     List[Any]									= [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
SCREAMING_SNAKE_CASE:     Union[str, Any]									= [3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
SCREAMING_SNAKE_CASE:     Tuple									= {
    0: '''Sunday''',
    1: '''Monday''',
    2: '''Tuesday''',
    3: '''Wednesday''',
    4: '''Thursday''',
    5: '''Friday''',
    6: '''Saturday''',
}


def 					_a							(					lowerCAmelCase    ,						lowerCAmelCase    ,						lowerCAmelCase )->	str:
		assert len(str(lowerCAmelCase ) ) > 2, "year should be in YYYY format"
		assert 1 <= month <= 12, "month should be between 1 to 12"
		assert 1 <= day <= 31, "day should be between 1 to 31"

		# Doomsday algorithm:
		SCREAMING_SNAKE_CASE_					      =							year // 100
		SCREAMING_SNAKE_CASE_					      =							(5 * (century % 4) + 2) % 7
		SCREAMING_SNAKE_CASE_					      =							year % 100
		SCREAMING_SNAKE_CASE_					      =							centurian % 12
		SCREAMING_SNAKE_CASE_					      =							(
		    (centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
		) % 7
		SCREAMING_SNAKE_CASE_					      =							(
		    DOOMSDAY_NOT_LEAP[month - 1]
		    if (year % 4 != 0) or (centurian == 0 and (year % 400) == 0)
		    else DOOMSDAY_LEAP[month - 1]
		)
		SCREAMING_SNAKE_CASE_					      =							(dooms_day + day - day_anchor) % 7
		return WEEK_DAY_NAMES[week_day]


if __name__ == "__main__":
						import doctest

						doctest.testmod()





from math import isqrt


def 					_a							(					lowerCAmelCase )->	bool:
		return all(number % divisor != 0 for divisor in range(2    ,						isqrt(lowerCAmelCase ) + 1 ) )


def 					_a							(					lowerCAmelCase = 10**6 )->	int:
		SCREAMING_SNAKE_CASE_					      =							0
		SCREAMING_SNAKE_CASE_					      =							1
		SCREAMING_SNAKE_CASE_					      =							7
		while prime_candidate < max_prime:
				primes_count += is_prime(lowerCAmelCase )

				cube_index += 1
				prime_candidate += 6 * cube_index

		return primes_count


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