input: Write a function to determine if a given number is an Armstrong number. An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. Return True if the number is an Armstrong number, otherwise return False.
  def is_armstrong_number(num):   
      n = len(str(num)) 
      # initialize sum  
      temp = num  
      sum_of_digits = 0
    
      # find sum of nth power of individual digits  
      while temp > 0:  
          digit = temp % 10  
          sum_of_digits += digit ** n  
          temp //= 10  
    
      # if num is equal to sum_of_digits then the number is an Armstrong number  
      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(9474)==True
  assert is_armstrong_number(123)==False
  assert is_armstrong_number(371)==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