input: Write a function to determine if a given number is an Armstrong number by calculating the sum of its digits each raised to the power of the number of digits, and checking if this sum equals the original number. If the given number is an Armstrong number, return True; otherwise, return False.
  def is_armstrong_number(num):
      n = len(str(num))
      temp = num
      sum_of_digits = 0
    
      while temp > 0:
          digit = temp % 10
          sum_of_digits += digit ** n
          temp //= 10
    
      if num == sum_of_digits:
          return True
      else:
          return False
  
  assert is_armstrong_number(153) == True
  assert is_armstrong_number(370) == True
  assert is_armstrong_number(371) == True
  assert is_armstrong_number(407) == True
  assert is_armstrong_number(1634) == True
  assert is_armstrong_number(9474) == True
  assert is_armstrong_number(9475) == False
  assert is_armstrong_number(0) == True
  assert is_armstrong_number(1) == True
output: def is_armstrong_number(num):
      n = len(str(num))
      temp = num
      sum_of_digits = 0
    
      while temp > 0:
          digit = temp % 10
          sum_of_digits += digit ** n
          temp //= 10
    
      if num == sum_of_digits:
          return True
      else:
          return False