






"""simple docstring"""







__a							:						Any   							=			(1, 153, 370, 371, 1634, 2467_8051, 115_1322_1901_8763_9925_6509_5597_9739_7152_2401)
__a							:						tuple   							=			(-153, -1, 0, 1.2, 200, "A", [], {}, None)





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_):
					if not isinstance(lowerCamelCase_			,  lowerCamelCase_) or n < 1:
										return False

					# Initialization of sum and number of digits.
					a__ 							=	0
					a__ 							=	0
					a__ 							=	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__ 							=	n
					while temp > 0:
										a__ 							=	temp % 10
										total += rem**number_of_digits
										temp //= 10
					return n == total





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_):
					if not isinstance(lowerCamelCase_			,  lowerCamelCase_) or n < 1:
										return False

					# Init a "histogram" of the digits
					a__ 							=	[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
					a__ 							=	0
					a__ 							=	0
					a__ 							=	n
					while temp > 0:
										a__							,a__ 							=	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 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_):
					if not isinstance(lowerCamelCase_			,  lowerCamelCase_) or n < 1:
										return False
					a__ 							=	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 							SCREAMING_SNAKE_CASE							(   ):
					a__ 							=	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()










"""simple docstring"""







from itertools import combinations, product





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_):
					if xa == ya == 0 or xa == ya == 0:
										return False
					a__ 							=	xa * xa + ya * ya
					a__ 							=	xa * xa + ya * ya
					a__ 							=	(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
					return (
					    a_square + b_square == c_square
					    or a_square + c_square == b_square
					    or b_square + c_square == a_square
					)





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_ = 50):
					return sum(
					    1
					    for pta, pta in combinations(product(range(limit + 1)			,  repeat=2)			,  2)
					    if is_right(*lowerCamelCase_			,  *lowerCamelCase_))


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


