Enter number n. Starting with the number n, multiply the given number by its first digit until the resulting number has the first digit equal to 1, or until it exceeds a billion. Output the result as an answer.

def first_digit(n):
  if n < 0:
    n = abs(n)
  elif n == 0:
    return 0
  else:
    return int(str(n)[0])

def multiply_first_digit(n):
  if n < 0:
    n = abs(n)
  elif n == 0:
    return 0
  else:
    while n // 10 >= 1:
      n = first_digit(n) * n
      if n >= 1000000000:
        return f'{n} exceeds a billion'
    return n
    
multiply_first_digit(1234)