import math
from datetime import datetime, timedelta







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

	# days to be added to March 21
	snake_case__			:				List[Any]       =  (19 * metonic_cycle + secular_moon_shift) % 30

	# PHM -> Paschal Full Moon
	snake_case__			:				Optional[Any]       =  (
	    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(__UpperCamelCase					,  4					,  19       )
	elif days_to_add == 28 and days_from_phm_to_sunday == 6:
		return datetime(__UpperCamelCase					,  4					,  18       )
	else:
		return datetime(__UpperCamelCase					,  3					,  22       ) + timedelta(
		    days=int(days_to_add + days_from_phm_to_sunday       )       )


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











import sys

__lowerCamelCase :      List[str]										=				(
    """73167176531330624919225119674426574742355349194934"""
    """96983520312774506326239578318016984801869478851843"""
    """85861560789112949495459501737958331952853208805511"""
    """12540698747158523863050715693290963295227443043557"""
    """66896648950445244523161731856403098711121722383113"""
    """62229893423380308135336276614282806444486645238749"""
    """30358907296290491560440772390713810515859307960866"""
    """70172427121883998797908792274921901699720888093776"""
    """65727333001053367881220235421809751254540594752243"""
    """52584907711670556013604839586446706324415722155397"""
    """53697817977846174064955149290862569321978468622482"""
    """83972241375657056057490261407972968652414535100474"""
    """82166370484403199890008895243450658541227588666881"""
    """16427171479924442928230863465674813919123162824586"""
    """17866458359124566529476545682848912883142607690042"""
    """24219022671055626321111109370544217506941658960408"""
    """07198403850962455444362981230987879927244284909188"""
    """84580156166097919133875499200524063689912560717606"""
    """05886116467109405077541002256983155200055935729725"""
    """71636269561882670428252483600823257530420752963450"""
)







def 					SCREAMING_SNAKE_CASE    (			snake_case_ :							str = N       ):
	snake_case__			:				Any       =  -sys.maxsize - 1
	for i in range(len(snake_case_       ) - 12       ):
		snake_case__			:				Tuple       =  1
		for j in range(13       ):
			product *= int(n[i + j]       )
		if product > largest_product:
			snake_case__			:				Dict       =  product
	return largest_product


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



