





"""simple docstring"""


__magic_name__       :					dict[tuple[int, int, int], int]						=			{}

def      UpperCamelCase							(SCREAMING_SNAKE_CASE							,     SCREAMING_SNAKE_CASE							,     SCREAMING_SNAKE_CASE     ):

						# if we are absent twice, or late 3 consecutive days,
						# no further prize strings are possible
						if late == 3 or absent == 2:
												return 0

						# if we have no days left, and have not failed any other rules,
						# we have a prize string
						if days == 0:
												return 1

						# No easy solution, so now we need to do the recursive calculation

						# First, check if the combination is already in the cache, and
						# if yes, return the stored value from there since we already
						# know the number of possible prize strings from this point on
						UpperCamelCase				:		Any				   =			(days, absent, late)
						if key in cache:
												return cache[key]

						# now we calculate the three possible ways that can unfold from
						# this point on, depending on our attendance today

						# 1) if we are late (but not absent), the "absent" counter stays as
						# it is, but the "late" counter increases by one
						UpperCamelCase				:		Dict				   =			_calculate(days - 1							,     SCREAMING_SNAKE_CASE							,     late + 1     )

						# 2) if we are absent, the "absent" counter increases by 1, and the
						# "late" counter resets to 0
						UpperCamelCase				:		int				   =			_calculate(days - 1							,     absent + 1							,     0     )

						# 3) if we are on time, this resets the "late" counter and keeps the
						# absent counter
						UpperCamelCase				:		Dict				   =			_calculate(days - 1							,     SCREAMING_SNAKE_CASE							,     0     )

						UpperCamelCase				:		Optional[int]				   =			state_late + state_absent + state_ontime

						UpperCamelCase				:		Any				   =			prizestrings
						return prizestrings

def      UpperCamelCase							(SCREAMING_SNAKE_CASE = 30     ):
						return _calculate(SCREAMING_SNAKE_CASE							,     absent=0							,     late=0     )


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










import baseaa
def      A__       (    SCREAMING_SNAKE_CASE_   :      str						)  ->  bytes:






   """simple docstring"""







   return baseaa.baaencode(string.encode('''utf-8'''						)						)
def      A__       (    SCREAMING_SNAKE_CASE_   :      bytes						)  ->  str:






   """simple docstring"""







   return baseaa.baadecode(SCREAMING_SNAKE_CASE_						).decode('''utf-8'''						)


if __name__ == "__main__":
   UpperCAmelCase_           =	"Hello World!"
   UpperCAmelCase_           =	baseaa_encode(test)
   print(encoded)

   UpperCAmelCase_           =	baseaa_decode(encoded)
   print(decoded)