






"""simple docstring"""


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



def    lowerCAmelCase							(       __UpperCamelCase					):




  """simple docstring"""







  if not isinstance(__UpperCamelCase						,			__UpperCamelCase					) 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 //= 1_0
  # Dividing number into separate digits and find Armstrong number
  __A		     =					n
  while temp > 0:
    __A		     =					temp % 1_0
    total += rem**number_of_digits
    temp //= 1_0
  return n == total



def    lowerCAmelCase							(       __UpperCamelCase					):




  """simple docstring"""







  if not isinstance(__UpperCamelCase						,			__UpperCamelCase					) 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(__UpperCamelCase						,			1_0					)
    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    lowerCAmelCase							(       __UpperCamelCase					):




  """simple docstring"""







  if not isinstance(__UpperCamelCase						,			__UpperCamelCase					) or n < 1:
    return False
  __A		     =					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    lowerCAmelCase							(       ):




  """simple docstring"""







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







import numpy as np







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=np.exp(lowerCAmelCase_     )

     # Add up the all the exponentials
     SCREAMING_SNAKE_CASE 		=np.sum(lowerCAmelCase_     )

     # Divide every exponent by the sum of all exponents
     SCREAMING_SNAKE_CASE 		=exponent_vector / sum_of_exponents

     return softmax_vector


if __name__ == "__main__":
 print(softmax((0,)))

