


'''simple docstring'''
import math
from datetime import datetime, timedelta


def       a				(      __a       )  ->     datetime:



					'''simple docstring'''






					UpperCamelCase__       :int							 =			year % 19
					UpperCamelCase__       :Any							 =			year % 4
					UpperCamelCase__       :Dict							 =			year % 7
					UpperCamelCase__       :Tuple							 =			math.floor(year / 100       )
					UpperCamelCase__       :List[Any]							 =			math.floor((13 + 8 * leap_day_inhibits) / 25       )
					UpperCamelCase__       :Union[str, Any]							 =			leap_day_inhibits / 4
					UpperCamelCase__       :int							 =			(
					    15 - lunar_orbit_correction + leap_day_inhibits - leap_day_reinstall_number
					) % 30
					UpperCamelCase__       :List[Any]							 =			(4 + leap_day_inhibits - leap_day_reinstall_number) % 7

					# days to be added to March 21
					UpperCamelCase__       :int							 =			(19 * metonic_cycle + secular_moon_shift) % 30

					# PHM -> Paschal Full Moon
					UpperCamelCase__       :Dict							 =			(
					    2 * julian_leap_year
					    + 4 * non_leap_year
					    + 6 * days_to_add
					    + century_starting_point
					) % 7

					if days_to_add == 29 and days_from_phm_to_sunday == 6:
										return datetime(__a			, 4			, 19       )
					elif days_to_add == 28 and days_from_phm_to_sunday == 6:
										return datetime(__a			, 4			, 18       )
					else:
										return datetime(__a			, 3			, 22       ) + timedelta(
										    days=int(days_to_add + days_from_phm_to_sunday       )       )


if __name__ == "__main__":
		for year in (1994, 2000, 2010, 2021, 2023):
				__snake_case											=					'''will be''' if year > datetime.now().year else '''was'''
				print(F"""Easter in {year} {tense} {gauss_easter(year)}""")









'''simple docstring'''
from __future__ import annotations

__snake_case											=					[True] * 1000001
__snake_case											=					2
while i * i <= 1000000:
		if seive[i]:
				for j in range(i * i, 1000001, i):
						__snake_case											=					False
		i += 1


def       a				(      __a       )  ->     bool:



					'''simple docstring'''






					return seive[n]


def       a				(      __a       )  ->     bool:



					'''simple docstring'''






					return any(digit in '''02468''' for digit in str(__a       )       )


def       a				(      __a = 1000000       )  ->     list[int]:



					'''simple docstring'''






					UpperCamelCase__       :Any							 =			[2]  # result already includes the number 2.
					for num in range(3			, limit + 1			, 2       ):
										if is_prime(__a       ) and not contains_an_even_digit(__a       ):
															UpperCamelCase__       :str							 =			str(__a       )
															UpperCamelCase__       :List[str]							 =			[int(str_num[j:] + str_num[:j]       ) for j in range(len(__a       )       )]
															if all(is_prime(__a       ) for i in list_nums       ):
																				result.append(__a       )
					return result


def       a				(      )  ->     int:



					'''simple docstring'''






					return len(find_circular_primes()       )


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