



'''simple docstring'''

UpperCAmelCase     		=   {}






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







	"""simple docstring"""

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

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

	lowerCAmelCase   =     state_late + state_absent + state_ontime

	lowerCAmelCase   =     prizestrings
	return prizestrings






def 		_snake_case		( _SCREAMING_SNAKE_CASE					:						int = 30							)      ->						int:







	"""simple docstring"""
	return _calculate(_SCREAMING_SNAKE_CASE							,		absent=0							,		late=0							)


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




'''simple docstring'''

class __snake_case(				_lowerCAmelCase ):


						'''simple docstring'''



						pass







class __snake_case(				_lowerCAmelCase ):


						'''simple docstring'''



						pass







class __snake_case:


						'''simple docstring'''



						def __init__( self				)     ->     int:
							lowerCAmelCase   =     [
							    [],
							    [],
							    [],
							]


						def     __snake_case   ( self     ,	A_     ,	A_				)     ->     None:
							try:
								if len(self.queues[priority]				) >= 100:
									raise OverflowError("""Maximum queue size is 100"""				)
								self.queues[priority].append(A_				)
							except IndexError:
								raise ValueError("""Valid priorities are 0, 1, and 2"""				)


						def     __snake_case   ( self				)     ->     int:
							for queue in self.queues:
								if queue:
									return queue.pop(0				)
							raise UnderFlowError("""All queues are empty"""				)




						def __str__( self				)     ->     str:
							return "\n".join(f'Priority {i}: {q}' for i, q in enumerate(self.queues				)				)







class __snake_case:


						'''simple docstring'''



						def __init__( self				)     ->     Dict:
							lowerCAmelCase   =     []


						def     __snake_case   ( self     ,	A_				)     ->     None:
							if len(self.queue				) == 100:
								raise OverFlowError("""Maximum queue size is 100"""				)
							self.queue.append(A_				)


						def     __snake_case   ( self				)     ->     int:
							if not self.queue:
								raise UnderFlowError("""The queue is empty"""				)
							else:
								lowerCAmelCase   =     min(self.queue				)
								self.queue.remove(A_				)
								return data




						def __str__( self				)     ->     str:
							return str(self.queue				)







def 		_snake_case		( )      ->						Tuple:







	"""simple docstring"""
	lowerCAmelCase   =     FixedPriorityQueue()
	fpq.enqueue(0							,		10							)
	fpq.enqueue(1							,		70							)
	fpq.enqueue(0							,		100							)
	fpq.enqueue(2							,		1							)
	fpq.enqueue(2							,		5							)
	fpq.enqueue(1							,		7							)
	fpq.enqueue(2							,		4							)
	fpq.enqueue(1							,		64							)
	fpq.enqueue(0							,		128							)
	print(_SCREAMING_SNAKE_CASE							)
	print(fpq.dequeue()							)
	print(fpq.dequeue()							)
	print(fpq.dequeue()							)
	print(fpq.dequeue()							)
	print(fpq.dequeue()							)
	print(_SCREAMING_SNAKE_CASE							)
	print(fpq.dequeue()							)
	print(fpq.dequeue()							)
	print(fpq.dequeue()							)
	print(fpq.dequeue()							)
	print(fpq.dequeue()							)






def 		_snake_case		( )      ->						Optional[Any]:







	"""simple docstring"""
	lowerCAmelCase   =     ElementPriorityQueue()
	epq.enqueue(10							)
	epq.enqueue(70							)
	epq.enqueue(100							)
	epq.enqueue(1							)
	epq.enqueue(5							)
	epq.enqueue(7							)
	epq.enqueue(4							)
	epq.enqueue(64							)
	epq.enqueue(128							)
	print(_SCREAMING_SNAKE_CASE							)
	print(epq.dequeue()							)
	print(epq.dequeue()							)
	print(epq.dequeue()							)
	print(epq.dequeue()							)
	print(epq.dequeue()							)
	print(_SCREAMING_SNAKE_CASE							)
	print(epq.dequeue()							)
	print(epq.dequeue()							)
	print(epq.dequeue()							)
	print(epq.dequeue()							)
	print(epq.dequeue()							)


if __name__ == "__main__":
				fixed_priority_queue()
				element_priority_queue()