



"""simple docstring"""







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



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



def   a_	(			__a      ):
     if not isinstance(__a		,							__a      ) 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(__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   a_	(			__a      ):
     if not isinstance(__a		,							__a      ) or n < 1:
          return False
     A__				=   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   a_	(			):
     A__				=   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()








"""simple docstring"""







from math import factorial



def   a_	(			__a		,							__a      ):
     return factorial(__a      ) / (factorial(__a      ) * factorial(n - r      ))



def   a_	(			):
     A__				=   0

     for i in range(1		,							101      ):
          for j in range(1		,							i + 1      ):
               if combinations(__a		,							__a      ) > 1e6:
                    total += 1
     return total


if __name__ == "__main__":
 print(solution())



