




__a  :		int		     =   (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)
__a  :		List[str]		     =   (-1_5_3, -1, 0, 1.2, 2_0_0, '''A''', [], {}, None)
def  snake_case_					(		SCREAMING_SNAKE_CASE_    )      ->			int:




							if not isinstance(_UpperCamelCase    ,_UpperCamelCase    ) or n < 1:
														return False

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




							if not isinstance(_UpperCamelCase    ,_UpperCamelCase    ) or n < 1:
														return False

							# Init a "histogram" of the digits
							lowercase__        =							[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
							lowercase__        =							0
							lowercase__        =							0
							lowercase__        =							n
							while temp > 0:
														lowercase__        =							divmod(_UpperCamelCase    ,10    )
														digit_histogram[rem] += 1
														digit_total += 1

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

							return n == total
def  snake_case_					(		SCREAMING_SNAKE_CASE_    )      ->			Optional[Any]:




							if not isinstance(_UpperCamelCase    ,_UpperCamelCase    ) or n < 1:
														return False
							lowercase__        =							len(str(_UpperCamelCase    )    )  # 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(_UpperCamelCase    ) ** expo for i in str(_UpperCamelCase    )    )
def  snake_case_					(		)      ->			List[Any]:
							lowercase__        =							int(input("Enter an integer to see if it is an Armstrong number: "    ).strip()    )
							print(F"""{num} is {"" if armstrong_number(_UpperCamelCase    ) else "not "}an Armstrong number."""    )
							print(F"""{num} is {"" if narcissistic_number(_UpperCamelCase    ) else "not "}an Armstrong number."""    )
							print(F"""{num} is {"" if pluperfect_number(_UpperCamelCase    ) else "not "}an Armstrong number."""    )


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						main()





def  snake_case_					(		)      ->			int:

							for a in range(3_00    ):
														for b in range(a + 1    ,4_00    ):
																					for c in range(b + 1    ,5_00    ):
																												if (a + b + c) == 10_00 and (a**2) + (b**2) == (c**2):
																																			return a * b * c

							return -1
def  snake_case_					(		)      ->			int:

							for a in range(3_00    ):
														for b in range(4_00    ):
																					lowercase__  :	Dict        =							10_00 - a - b
																					if a < b < c and (a**2) + (b**2) == (c**2):
																												return a * b * c

							return -1
def  snake_case_					(		)      ->			None:
							import timeit

							print(
							    timeit.timeit("solution()"    ,setup="from __main__ import solution"    ,number=10_00    )    )
							print(
							    timeit.timeit(
							        "solution_fast()"    ,setup="from __main__ import solution_fast"    ,number=10_00    )    )


if __name__ == "__main__":
						print(f'{solution() = }')