




def 		lowercase__   (		__A:	Optional[int]				):





					'''simple docstring'''






					return "".join([hex(__UpperCamelCase				)[2:].zfill(2				).upper() for byte in list(__UpperCamelCase				)]				)







def 		lowercase__   (		__A:	Union[str, Any]				):





					'''simple docstring'''






					if (len(__UpperCamelCase				) % 2) != 0:
										raise ValueError(
										    '''Base16 encoded data is invalid:
Data does not have an even number of hex digits.'''				)
					# Check the character set - the standard base16 alphabet
					# is uppercase according to RFC3548 section 6
					if not set(__UpperCamelCase				) <= set('''0123456789ABCDEF'''				):
										raise ValueError(
										    '''Base16 encoded data is invalid:
Data is not uppercase hex or it contains invalid characters.'''				)
					# For every two hexadecimal digits (= a byte), turn it into an integer.
					# Then, string the result together into bytes, and return it.
					return bytes(int(data[i] + data[i + 1]							,1_6				) for i in range(0							,len(__UpperCamelCase				)							,2				)				)


if __name__ == "__main__":
	import doctest

	doctest.testmod()









import functools







def 		lowercase__   (		__A:	list[int]							,__A:	list[int]				):





					'''simple docstring'''






					if not isinstance(__A							,__A				) or not all(isinstance(__A							,__A				) for day in days				):
										raise ValueError('''The parameter days should be a list of integers'''				)

					if len(__A				) != 3 or not all(isinstance(__A							,__A				) for cost in costs				):
										raise ValueError('''The parameter costs should be a list of three integers'''				)

					if len(__A				) == 0:
										return 0

					if min(__A				) <= 0:
										raise ValueError('''All days elements should be greater than 0'''				)

					if max(__A				) >= 3_6_6:
										raise ValueError('''All days elements should be less than 366'''				)

					__magic_name__							:	Tuple    							=							set(__A				)

					@functools.cache
					def dynamic_programming(__A:	int				) -> int:
										if index > 3_6_5:
															return 0

										if index not in days_set:
															return dynamic_programming(index + 1				)

										return min(
										    costs[0] + dynamic_programming(index + 1				)							,costs[1] + dynamic_programming(index + 7				)							,costs[2] + dynamic_programming(index + 3_0				)							,)

					return dynamic_programming(1				)


if __name__ == "__main__":
	import doctest

	doctest.testmod()



