


"""simple docstring"""
__SCREAMING_SNAKE_CASE							:      dict[tuple[int, int, int], int]						=      {}







def   _a			( _SCREAMING_SNAKE_CASE			,	_SCREAMING_SNAKE_CASE			,	_SCREAMING_SNAKE_CASE			)      ->			int:

							# 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
							snake_case_          =						(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
							snake_case_          =						_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
							snake_case_          =						_calculate(days - 1			,	absent + 1			,	0			)

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

							snake_case_          =						state_late + state_absent + state_ontime

							snake_case_          =						prizestrings
							return prizestrings







def   _a			( _SCREAMING_SNAKE_CASE = 30			)      ->			int:
							return _calculate(_SCREAMING_SNAKE_CASE			,	absent=0			,	late=0			)


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







"""simple docstring"""
def   _a			( _SCREAMING_SNAKE_CASE			)      ->			int:
							assert column_title.isupper()
							snake_case_          =						0
							snake_case_          =						len(_SCREAMING_SNAKE_CASE			) - 1
							snake_case_          =						0

							while index >= 0:
														snake_case_          =						(ord(column_title[index]			) - 64) * pow(26			,	_SCREAMING_SNAKE_CASE			)
														answer += value
														power += 1
														index -= 1

							return answer


if __name__ == "__main__":
				from doctest import testmod

				testmod()



