
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()











from .chunk_utils import chunk_layer
from .data_transforms import make_atomaa_masks
from .feats import atomaa_to_atomaa, frames_and_literature_positions_to_atomaa_pos, torsion_angles_to_frames
from .loss import compute_predicted_aligned_error, compute_tm
from .protein import Protein as OFProtein
from .protein import to_pdb
from .rigid_utils import Rigid, Rotation
from .tensor_utils import dict_multimap, flatten_final_dims, permute_final_dims





