




"""simple docstring"""



SCREAMING_SNAKE_CASE							=			(1, 153, 370, 371, 1634, 2467_8051, 115_1322_1901_8763_9925_6509_5597_9739_7152_2401)
SCREAMING_SNAKE_CASE							=			(-153, -1, 0, 1.2, 200, "A", [], {}, None)







def     _SCREAMING_SNAKE_CASE  (				lowercase_		)		->						bool:
 if not isinstance(lowercase_     ,					lowercase_		) or n < 1:
  return False

 # Initialization of sum and number of digits.
 A__			=							0
 A__			=							0
 A__			=							n
 # Calculation of digits of the number
 while temp > 0:
  number_of_digits += 1
  temp //= 10
 # Dividing number into separate digits and find Armstrong number
 A__			=							n
 while temp > 0:
  A__			=							temp % 10
  total += rem**number_of_digits
  temp //= 10
 return n == total







def     _SCREAMING_SNAKE_CASE  (				lowercase_		)		->						bool:
 if not isinstance(lowercase_     ,					lowercase_		) or n < 1:
  return False

 # Init a "histogram" of the digits
 A__			=							[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
 A__			=							0
 A__			=							0
 A__			=							n
 while temp > 0:
  A__, A__			=							divmod(lowercase_     ,					10		)
  digit_histogram[rem] += 1
  digit_total += 1

 for cnt, i in zip(lowercase_     ,					range(len(lowercase_		)		)		):
  total += cnt * i**digit_total

 return n == total







def     _SCREAMING_SNAKE_CASE  (				lowercase_		)		->						bool:
 if not isinstance(lowercase_     ,					lowercase_		) or n < 1:
  return False
 A__			=							len(str(lowercase_		)		)  # the power that all digits will be raised to
 # check if sum of each digit multiplied expo times is equal to number
 return n == sum(int(lowercase_		) ** expo for i in str(lowercase_		)		)







def     _SCREAMING_SNAKE_CASE  (				)		->						int:
 A__			=							int(input("Enter an integer to see if it is an Armstrong number: "		).strip()		)
 print(f"""{num} is {"" if armstrong_number(lowercase_		) else "not "}an Armstrong number."""		)
 print(f"""{num} is {"" if narcissistic_number(lowercase_		) else "not "}an Armstrong number."""		)
 print(f"""{num} is {"" if pluperfect_number(lowercase_		) else "not "}an Armstrong number."""		)


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      main()











"""simple docstring"""



def     _SCREAMING_SNAKE_CASE  (				lowercase_ = 10_00		)		->						int:
 A__			=							0
 A__			=							0
 while 1:
  num += 3
  if num >= n:
   break
  total += num
  num += 2
  if num >= n:
   break
  total += num
  num += 1
  if num >= n:
   break
  total += num
  num += 3
  if num >= n:
   break
  total += num
  num += 1
  if num >= n:
   break
  total += num
  num += 2
  if num >= n:
   break
  total += num
  num += 3
  if num >= n:
   break
  total += num
 return total


if __name__ == "__main__":
      print(f'{solution() = }')





