_lowerCAmelCase        =       (1, 1_5_3, 3_7_0, 3_7_1, 1_6_3_4, 2_4_6_7_8_0_5_1, 1_1_5_1_3_2_2_1_9_0_1_8_7_6_3_9_9_2_5_6_5_0_9_5_5_9_7_9_7_3_9_7_1_5_2_2_4_0_1)
_lowerCAmelCase        =       (-1_5_3, -1, 0, 1.2, 2_0_0, "A", [], {}, None)


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

       # Initialization of sum and number of digits.
       A_							:       List[Any]	      =				0
       A_							:       Any	      =				0
       A_							:       Optional[int]	      =				n
       # Calculation of digits of the number
       while temp > 0:
              number_of_digits += 1
              temp //= 1_0
       # Dividing number into separate digits and find Armstrong number
       A_							:       List[Any]	      =				n
       while temp > 0:
              A_							:       List[str]	      =				temp % 1_0
              total += rem**number_of_digits
              temp //= 1_0
       return n == total


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

       # Init a "histogram" of the digits
       A_							:       Union[str, Any]	      =				[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
       A_							:       Tuple	      =				0
       A_							:       str	      =				0
       A_							:       Any	      =				n
       while temp > 0:
              A_      ,							A_							:       Dict	      =				divmod(a  ,   1_0							)
              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       a__      (					a							)		->	bool:
       if not isinstance(a  ,   a							) or n < 1:
              return False
       A_							:       int	      =				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       a__      (					)		->	Optional[Any]:
       A_							:       Optional[Any]	      =				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()



from transformers import ProcessorMixin






class     __UpperCAmelCase(    A__				):






 """simple docstring"""




 __magic_name__          =   """AutoFeatureExtractor"""
 __magic_name__          =   """AutoTokenizer"""


