
a_								=   (1, 153, 370, 371, 1_634, 24_678_051, 115_132_219_018_763_992_565_095_597_973_971_522_401)
a_								=   (-153, -1, 0, 1.2, 200, "A", [], {}, None)





def 						a__     (						_UpperCamelCase     :	int							):



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

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





def 						a__     (						_UpperCamelCase     :	int							):



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

   # Init a "histogram" of the digits
   __lowerCamelCase  							=      [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
   __lowerCamelCase  							=      0
   __lowerCamelCase  							=      0
   __lowerCamelCase  							=      n
   while temp > 0:
      __lowerCamelCase							,__lowerCamelCase  							=      divmod(UpperCamelCase_	,10							)
      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 						a__     (						_UpperCamelCase     :	int							):



   if not isinstance(UpperCamelCase_	,UpperCamelCase_							) or n < 1:
      return False
   __lowerCamelCase  							=      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 						a__     (						):
   __lowerCamelCase  							=      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 platform
from argparse import ArgumentParser

import huggingface_hub
import pandas
import pyarrow

from datasets import __version__ as version
from datasets.commands import BaseDatasetsCLICommand





def 						a__     (						_UpperCamelCase     :	Optional[Any]							):
   return EnvironmentCommand()





class 	__lowerCAmelCase       (		lowerCAmelCase__				):




 @staticmethod
 def     lowerCamelCase (  __UpperCAmelCase			):



    '''simple docstring'''
    __lowerCamelCase  							=      parser.add_parser('''env'''		,			help='''Print relevant system environment info.'''			)
    download_parser.set_defaults(func=__UpperCAmelCase			)




 def     lowerCamelCase (  self			):



    '''simple docstring'''
    __lowerCamelCase  							=      {
        '''`datasets` version''': version,
        '''Platform''': platform.platform(),
        '''Python version''': platform.python_version(),
        '''Huggingface_hub version''': huggingface_hub.__version__,
        '''PyArrow version''': pyarrow.__version__,
        '''Pandas version''': pandas.__version__,
    }

    print('''\nCopy-and-paste the text below in your GitHub issue.\n'''			)
    print(self.format_dict(__UpperCAmelCase			)			)

    return info




 @staticmethod
 def     lowerCamelCase (  __UpperCAmelCase			):



    '''simple docstring'''
    return "\n".join([F"""- {prop}: {val}""" for prop, val in d.items()]			) + "\n"






