

from __future__ import annotations


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ):
						assert n > 1 and a > 0 and greatest_common_divisor(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ) == 1
						((snake_case_),					(snake_case_),					(snake_case_))     =			extended_gcd(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ )  # Implemented below
						snake_case_     =			(b * s) % n
						return x


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ):
						((snake_case_),					(snake_case_))     =			extended_euclid(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ )  # Implemented below
						if b < 0:
												snake_case_     =			(b % n + n) % n
						return b


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ):
						snake_case_     =			invert_modulo(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ )
						snake_case_     =			(b * s) % n
						return x


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ):
						assert a >= 0 and b >= 0

						if b == 0:
												snake_case_,					snake_case_,					snake_case_     =			a, 1, 0
						else:
												((snake_case_),					(snake_case_),					(snake_case_))     =			extended_gcd(SCREAMING_SNAKE_CASE__						,	a % b )
												snake_case_     =			q
												snake_case_     =			p - q * (a // b)

						assert a % d == 0 and b % d == 0
						assert d == a * x + b * y

						return (d, x, y)


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ):
						if b == 0:
												return (1, 0)
						((snake_case_),					(snake_case_))     =			extended_euclid(SCREAMING_SNAKE_CASE__						,	a % b )
						snake_case_     =			a // b
						return (y, x - k * y)


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ):
						if a < b:
												snake_case_,					snake_case_     =			b, a

						while a % b != 0:
												snake_case_,					snake_case_     =			b, a % b

						return b


if __name__ == "__main__":
					from doctest import testmod

					testmod(name='''modular_division''', verbose=True)
					testmod(name='''modular_division2''', verbose=True)
					testmod(name='''invert_modulo''', verbose=True)
					testmod(name='''extended_gcd''', verbose=True)
					testmod(name='''extended_euclid''', verbose=True)
					testmod(name='''greatest_common_divisor''', verbose=True)


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


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__ ):
						if not isinstance(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ) or n < 1:
												return False

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


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__ ):
						if not isinstance(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ) or n < 1:
												return False

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

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

						return n == total


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__ ):
						if not isinstance(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ) or n < 1:
												return False
						snake_case_     =			len(str(SCREAMING_SNAKE_CASE__ ) )  # 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(SCREAMING_SNAKE_CASE__ ) ** expo for i in str(SCREAMING_SNAKE_CASE__ ) )


def 						__SCREAMING_SNAKE_CASE      ():
						snake_case_     =			int(input('''Enter an integer to see if it is an Armstrong number: ''' ).strip() )
						print(F'''{num} is {'' if armstrong_number(SCREAMING_SNAKE_CASE__ ) else 'not '}an Armstrong number.''' )
						print(F'''{num} is {'' if narcissistic_number(SCREAMING_SNAKE_CASE__ ) else 'not '}an Armstrong number.''' )
						print(F'''{num} is {'' if pluperfect_number(SCREAMING_SNAKE_CASE__ ) else 'not '}an Armstrong number.''' )


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					main()