





def lowerCamelCase__    (							snake_case_	:  int = 200       )      ->				int:
   __snake_case							       =   [1, 2, 5, 10, 20, 50, 100, 200]
   __snake_case							       =   [0] * (pence + 1)
   __snake_case							       =   1  # base case: 1 way to make 0 pence

   for coin in coins:
      for i in range(snake_case_       ,      pence + 1       ,      1       ):
         number_of_ways[i] += number_of_ways[i - coin]
   return number_of_ways[pence]


if __name__ == "__main__":
    assert solution(200) == 73682








from math import loga






def lowerCamelCase__    (							snake_case_	:  int       )      ->				int:
   if a < 0:
      raise ValueError('''Input value must be a positive integer'''       )
   elif isinstance(snake_case_       ,      snake_case_       ):
      raise TypeError('''Input value must be a \'int\' type'''       )
   return 0 if (a == 0) else int(loga(a & -a       )       )


if __name__ == "__main__":
    import doctest

    doctest.testmod()

