


'''simple docstring'''



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






def   lowerCamelCase							(_SCREAMING_SNAKE_CASE      :   int						,      _SCREAMING_SNAKE_CASE      :   int						,      _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
					__a			:       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
					__a			:       Union[str, Any]					    =  _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
					__a			:       Optional[Any]					    =  _calculate(days - 1						,      absent + 1						,      0   )

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

					__a			:       Dict					    =  state_late + state_absent + state_ontime

					__a			:       str					    =  prizestrings
					return prizestrings






def   lowerCamelCase							(_SCREAMING_SNAKE_CASE      :   int = 30   ):
					return _calculate(_SCREAMING_SNAKE_CASE						,      absent=0						,      late=0   )


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





"""simple docstring"""




def lowercase_  (   _snake_case						):
							if a < 0:
														raise ValueError("""Input value must be a positive integer"""						)
							elif isinstance(_snake_case   ,_snake_case						):
														raise TypeError("""Input value must be a 'int' type"""						)
							return bin(_snake_case						).count("""1"""						)


if __name__ == "__main__":
					import doctest

					doctest.testmod()




