




def 				SCREAMING_SNAKE_CASE_				(							__A       :				Any						)				->				int:

   if number != int(__A						):
      raise ValueError("factorial() only accepts integral values"						)
   if number < 0:
      raise ValueError("factorial() not defined for negative values"						)
   _SCREAMING_SNAKE_CASE =   1
   for i in range(1 ,  number + 1						):
      value *= i
   return value
def 				SCREAMING_SNAKE_CASE_				(							__A       :				Dict						)				->				int:

   if not isinstance(__A ,  __A						):
      raise ValueError("factorial() only accepts integral values"						)
   if n < 0:
      raise ValueError("factorial() not defined for negative values"						)
   return 1 if n == 0 or n == 1 else n * factorial(n - 1						)


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 lowerCamelCase_	 =		int(input('Enter a positive integer: ').strip() or 0)
 print(f'''factorial{n} is {factorial(n)}''')







'''simple docstring'''



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_				(							__A       :				int						)				->				bool:
   if not isinstance(__A ,  __A						) or n < 1:
      return False

   # Initialization of sum and number of digits.
   _SCREAMING_SNAKE_CASE =   0
   _SCREAMING_SNAKE_CASE =   0
   _SCREAMING_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
   _SCREAMING_SNAKE_CASE =   n
   while temp > 0:
      _SCREAMING_SNAKE_CASE =   temp % 10
      total += rem**number_of_digits
      temp //= 10
   return n == total
def 				SCREAMING_SNAKE_CASE_				(							__A       :				int						)				->				bool:
   if not isinstance(__A ,  __A						) or n < 1:
      return False

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

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

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


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()

