
lowerCamelCase_  :       int					      =     (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)
lowerCamelCase_  :       tuple					      =     (-1_53, -1, 0, 1.2, 2_00, "A", [], {}, None)







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

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







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

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








import warnings

from ...utils import logging
from .image_processing_mobilenet_va import MobileNetVaImageProcessor


lowerCamelCase_  :       List[Any]					      =     logging.get_logger(__name__)

class 				_UpperCamelCase (    _A     ):






			'''simple docstring'''

			def __init__(				self       :				Dict  ,		*snake_case_       :				Optional[int]  ,		**snake_case_       :				List[Any]					):
							warnings.warn(
							    """The class MobileNetV2FeatureExtractor is deprecated and will be removed in version 5 of Transformers."""
							    """ Please use MobileNetV2ImageProcessor instead."""  ,		snake_case_  ,		)
							super().__init__(*snake_case_  ,		**snake_case_					)






