


'''simple docstring'''



def       _UpperCamelCase (						UpperCamelCase__   ):
   if not isinstance(UpperCamelCase__	, UpperCamelCase__   ):
      raise ValueError("""Input must be an integer"""   )
   if input_num <= 0:
      raise ValueError("""Input must be positive"""   )
   return sum(
       divisor for divisor in range(1	, input_num // 2 + 1   ) if input_num % divisor == 0   )


if __name__ == "__main__":
  import doctest

  doctest.testmod()



'''simple docstring'''



import functools







def       _UpperCamelCase (						UpperCamelCase__	, UpperCamelCase__   ):

			# Validation
			if not isinstance(UpperCamelCase__	, UpperCamelCase__   ) or not all(isinstance(UpperCamelCase__	, UpperCamelCase__   ) for day in days   ):
						raise ValueError("""The parameter days should be a list of integers"""   )

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

			if len(UpperCamelCase__   ) == 0:
						return 0

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

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

			UpperCAmelCase__					:   Union[str, Any]       				=       set(UpperCamelCase__   )

			@functools.cache
			def dynamic_programming(UpperCamelCase__   ) -> 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()