input: Write a python function that computes the product of all odd digits in a provided positive integer n, returning 0 if no odd digits are present.
  assert digits(5) == 5
  assert digits(54) == 5
  assert digits(120) == 1
  assert digits(5014) == 5
  assert digits(98765) == 315
  assert digits(5576543) == 2625
  assert digits(2468) == 0
output: 
  def digits(n):
      product = 1
      odd_found = False
      while n > 0:
          digit = n % 10
          if digit % 2 == 1:
              product *= digit
              odd_found = True
          n //= 10
      return product if odd_found else 0
  