fibonacci numbers with dynamic programming

hello.py

def memoize(func):
  cache = {}
  def wrapper(*args):
    try:
      return cache[args]
    except:
      result = func(*args)
      cache[args] = result
      return result
  return wrapper

@memoize
def fibonacci(n, counter, product):
  if n == 0:
    return product
  else:
    return fibonacci(n-1, product, counter+product)