






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

def    SCREAMING_SNAKE_CASE_							(							__magic_name__					:  int	,			__magic_name__					:  int	,			__magic_name__					:  int					)		->			int:






	"""simple docstring"""



	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     :List[str]          =	(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     :List[str]          =	_calculate(days - 1	,			__magic_name__	,			late + 1					)

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

	# 3) if we are on time, this resets the "late" counter and keeps the
	# absent counter
	UpperCamelCase     :List[str]          =	_calculate(days - 1	,			__magic_name__	,			0					)

	UpperCamelCase     :Union[str, Any]          =	state_late + state_absent + state_ontime

	UpperCamelCase     :Optional[int]          =	prizestrings
	return prizestrings

def    SCREAMING_SNAKE_CASE_							(							__magic_name__					:  int = 30					)		->			int:






	"""simple docstring"""



	return _calculate(__magic_name__	,			absent=0	,			late=0					)


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




'''simple docstring'''
def 					a__       (					lowerCAmelCase__						)    ->	int:
    if a < 0:
        raise ValueError('''Input value must be a positive integer'''						)
    elif isinstance(lowerCAmelCase__  ,					lowerCAmelCase__						):
        raise TypeError('''Input value must be a \'int\' type'''						)
    return bin(lowerCAmelCase__						).count('''1'''						)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
