





_SCREAMING_SNAKE_CASE   						=		(1, 1_53, 3_70, 3_71, 16_34, 24_67_80_51, 1_15_13_22_19_01_87_63_99_25_65_09_55_97_97_39_71_52_24_01)
_SCREAMING_SNAKE_CASE   						=		(-1_53, -1, 0, 1.2, 2_00, "A", [], {}, None)


def 				SCREAMING_SNAKE_CASE__    (     __a ):
	if not isinstance(__a ,			__a ) or n < 1:
		return False

	# Initialization of sum and number of digits.
	snake_case_		:      Optional[Any]           =						0
	snake_case_		:      Dict           =						0
	snake_case_		:      Dict           =						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
	snake_case_		:      Optional[int]           =						n
	while temp > 0:
		snake_case_		:      Optional[Any]           =						temp % 10
		total += rem**number_of_digits
		temp //= 10
	return n == total


def 				SCREAMING_SNAKE_CASE__    (     __a ):
	if not isinstance(__a ,			__a ) or n < 1:
		return False

	# Init a "histogram" of the digits
	snake_case_		:      Optional[int]           =						[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
	snake_case_		:      Dict           =						0
	snake_case_		:      Dict           =						0
	snake_case_		:      Tuple           =						n
	while temp > 0:
		snake_case_    ,snake_case_		:      List[Any]           =						divmod(__a ,			10 )
		digit_histogram[rem] += 1
		digit_total += 1

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

	return n == total


def 				SCREAMING_SNAKE_CASE__    (     __a ):
	if not isinstance(__a ,			__a ) or n < 1:
		return False
	snake_case_		:      str           =						len(str(__a ) )  # 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(__a ) ** expo for i in str(__a ) )


def 				SCREAMING_SNAKE_CASE__    (     ):
	snake_case_		:      int           =						int(input('Enter an integer to see if it is an Armstrong number: ' ).strip() )
	print(f"""{num} is {'' if armstrong_number(__a ) else 'not '}an Armstrong number.""" )
	print(f"""{num} is {'' if narcissistic_number(__a ) else 'not '}an Armstrong number.""" )
	print(f"""{num} is {'' if pluperfect_number(__a ) else 'not '}an Armstrong number.""" )


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						main()







def       lowerCAmelCase_      (	lowerCamelCase:							str    )       ->      int:


      '''simple docstring'''




      lowerCamelCase__   	=					str(lowerCamelCase    ).strip()
      if not bin_string:
            raise ValueError('Empty string was passed to the function'    )
      lowerCamelCase__   	=					bin_string[0] == '-'
      if is_negative:
            lowerCamelCase__   	=					bin_string[1:]
      if not all(char in '01' for char in bin_string    ):
            raise ValueError('Non-binary value was passed to the function'    )
      lowerCamelCase__   	=					0
      for char in bin_string:
            lowerCamelCase__   	=					2 * decimal_number + int(lowerCamelCase    )
      return -decimal_number if is_negative else decimal_number


if __name__ == "__main__":
      from doctest import testmod

      testmod()