






def 						A_					(						lowercase_			)				->int:







 """simple docstring"""

 SCREAMING_SNAKE_CASE				    =		str(lowercase_			).strip()
 if not oct_string:
  raise ValueError('Empty string was passed to the function'			)
 SCREAMING_SNAKE_CASE				    =		oct_string[0] == '-'
 if is_negative:
  SCREAMING_SNAKE_CASE				    =		oct_string[1:]
 if not oct_string.isdigit() or not all(0 <= int(lowercase_			) <= 7 for char in oct_string			):
  raise ValueError('Non-octal value was passed to the function'			)
 SCREAMING_SNAKE_CASE				    =		0
 for char in oct_string:
  SCREAMING_SNAKE_CASE				    =		8 * decimal_number + int(lowercase_			)
 if is_negative:
  SCREAMING_SNAKE_CASE				    =		-decimal_number
 return decimal_number


if __name__ == "__main__":
      from doctest import testmod

      testmod()











def        A__						(							SCREAMING_SNAKE_CASE_				,							SCREAMING_SNAKE_CASE_		) ->  Union[str, Any]:
		if n < 0:
				return 0
		# table[i] represents the number of ways to get to amount i
		lowerCamelCase :			int    		=[0] * (n + 1)

		# There is exactly 1 way to get to zero(You pick no coins).
		lowerCamelCase :			List[Any]    		=1

		# Pick all coins one by one and update table[] values
		# after the index greater than or equal to the value of the
		# picked coin
		for coin_val in s:
				for j in range(SCREAMING_SNAKE_CASE_				,							n + 1		):
						table[j] += table[j - coin_val]

		return table[n]


if __name__ == "__main__":
				import doctest

				doctest.testmod()

