

def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ ):
						snake_case_     =			[]
						snake_case_     =			len(SCREAMING_SNAKE_CASE__ )
						for i in range(SCREAMING_SNAKE_CASE__ ):
												snake_case_     =			[]
												for j in range(SCREAMING_SNAKE_CASE__ ):
																		snake_case_     =			0
																		for k in range(SCREAMING_SNAKE_CASE__ ):
																								snake_case_     =			val + matrix_a[i][k] * matrix_b[k][j]
																		list_a.append(SCREAMING_SNAKE_CASE__ )
												matrix_c.append(SCREAMING_SNAKE_CASE__ )
						return matrix_c


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__ ):
						return [[int(row == column ) for column in range(SCREAMING_SNAKE_CASE__ )] for row in range(SCREAMING_SNAKE_CASE__ )]


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__ ):
						if n <= 1:
												return n
						snake_case_     =			identity(2 )
						snake_case_     =			[[1, 1], [1, 0]]
						snake_case_     =			n - 1
						while n > 0:
												if n % 2 == 1:
																		snake_case_     =			multiply(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ )
												snake_case_     =			multiply(SCREAMING_SNAKE_CASE__						,	SCREAMING_SNAKE_CASE__ )
												snake_case_     =			int(n / 2 )
						return res_matrix[0][0]


def 						__SCREAMING_SNAKE_CASE      (SCREAMING_SNAKE_CASE__ ):
						if n <= 1:
												return n
						snake_case_     =			0
						snake_case_     =			1
						for _ in range(2						,	n + 1 ):
												snake_case_,					snake_case_     =			fiba, fiba + fiba
						return fiba


def 						__SCREAMING_SNAKE_CASE      ():
						for ordinal in "0th 1st 2nd 3rd 10th 100th 1000th".split():
												snake_case_     =			int(''''''.join(c for c in ordinal if c in '''0123456789''' ) )  # 1000th --> 1000
												print(
												    F'''{ordinal} fibonacci number using matrix exponentiation is '''
												    F'''{nth_fibonacci_matrix(SCREAMING_SNAKE_CASE__ )} and using bruteforce is '''
												    F'''{nth_fibonacci_bruteforce(SCREAMING_SNAKE_CASE__ )}\n''' )
						# from timeit import timeit
						# print(timeit("nth_fibonacci_matrix(1000000)",
						#              "from main import nth_fibonacci_matrix", number=5))
						# print(timeit("nth_fibonacci_bruteforce(1000000)",
						#              "from main import nth_fibonacci_bruteforce", number=5))
						# 2.3342058970001744
						# 57.256506615000035


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					main()


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