from datetime import datetime

import matplotlib.pyplot as plt
import torch







def 						lowerCamelCase(   a__):
				for param in module.parameters():
								_SCREAMING_SNAKE_CASE			  =False







def 						lowerCamelCase(   ):
				_SCREAMING_SNAKE_CASE			  ='''cuda''' if torch.cuda.is_available() else '''cpu'''
				if torch.backends.mps.is_available() and torch.backends.mps.is_built():
								_SCREAMING_SNAKE_CASE			  ='''mps'''
				if device == "mps":
								print(
								    '''WARNING: MPS currently doesn\'t seem to work, and messes up backpropagation without any visible torch'''
								    ''' errors. I recommend using CUDA on a colab notebook or CPU instead if you\'re facing inexplicable issues'''
								    ''' with generations.''')
				return device







def 						lowerCamelCase(   a__):
				_SCREAMING_SNAKE_CASE			  =plt.imshow(a__)
				fig.axes.get_xaxis().set_visible(a__)
				fig.axes.get_yaxis().set_visible(a__)
				plt.show()







def 						lowerCamelCase(   ):
				_SCREAMING_SNAKE_CASE			  =datetime.now()
				_SCREAMING_SNAKE_CASE			  =current_time.strftime('''%H:%M:%S''')
				return timestamp



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







def 						lowerCamelCase(   a__	,a__	,a__):

				# 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
				_SCREAMING_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
				_SCREAMING_SNAKE_CASE			  =_calculate(days - 1	,a__	,late + 1)

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

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

				_SCREAMING_SNAKE_CASE			  =state_late + state_absent + state_ontime

				_SCREAMING_SNAKE_CASE			  =prizestrings
				return prizestrings







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


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