


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

def 		_UpperCAmelCase							(     SCREAMING_SNAKE_CASE__     :   Union[str, Any]							):







     if not isinstance(lowercase__     ,	lowercase__							) or n < 1:
          return False

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

def 		_UpperCAmelCase							(     SCREAMING_SNAKE_CASE__     :   Tuple							):







     if not isinstance(lowercase__     ,	lowercase__							) or n < 1:
          return False

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

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

     return n == total

def 		_UpperCAmelCase							(     SCREAMING_SNAKE_CASE__     :   Tuple							):







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

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


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   main()










'''simple docstring'''


from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_sentencepiece_available, is_tokenizers_available


lowercase											=      {}

try:
  if not is_sentencepiece_available():
    raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
  pass
else:
  lowercase											=      ['''BarthezTokenizer''']

try:
  if not is_tokenizers_available():
    raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
  pass
else:
  lowercase											=      ['''BarthezTokenizerFast''']


if TYPE_CHECKING:
  try:
    if not is_sentencepiece_available():
      raise OptionalDependencyNotAvailable()
  except OptionalDependencyNotAvailable:
    pass
  else:
    from .tokenization_barthez import BarthezTokenizer

  try:
    if not is_tokenizers_available():
      raise OptionalDependencyNotAvailable()
  except OptionalDependencyNotAvailable:
    pass
  else:
    from .tokenization_barthez_fast import BarthezTokenizerFast

else:
  import sys

  lowercase											=      _LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)


