



__SCREAMING_SNAKE_CASE     =	(1, 153, 370, 371, 1634, 24678051, 115132219018763992565095597973971522401)
__SCREAMING_SNAKE_CASE     =	(-153, -1, 0, 1.2, 200, "A", [], {}, None)




def 						UpperCAmelCase (    _lowerCamelCase     ):
			if not isinstance(_lowerCamelCase			,     _lowerCamelCase     ) or n < 1:
						return False

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




def 						UpperCAmelCase (    _lowerCamelCase     ):
			if not isinstance(_lowerCamelCase			,     _lowerCamelCase     ) or n < 1:
						return False

			# Init a "histogram" of the digits
			A				:       str														=    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
			A				:       Tuple														=    0
			A				:       List[str]														=    0
			A				:       Any														=    n
			while temp > 0:
						A							,			A				:       List[Any]														=    divmod(_lowerCamelCase			,     10     )
						digit_histogram[rem] += 1
						digit_total += 1

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

			return n == total




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




def 						UpperCAmelCase (    ):
			A				:       Any														=    int(input("Enter an integer to see if it is an Armstrong number: "     ).strip()     )
			print(f"""{num} is {"" if armstrong_number(_lowerCamelCase     ) else "not "}an Armstrong number."""     )
			print(f"""{num} is {"" if narcissistic_number(_lowerCamelCase     ) else "not "}an Armstrong number."""     )
			print(f"""{num} is {"" if pluperfect_number(_lowerCamelCase     ) else "not "}an Armstrong number."""     )


if __name__ == "__main__":
							import doctest

							doctest.testmod()
							main()




def 						UpperCAmelCase (    _lowerCamelCase     ):
			return "".join(chr(ord(_lowerCamelCase     ) + 32     ) if "A" <= char <= "Z" else char for char in word     )


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

							testmod()