




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        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						bool:

    """simple docstring"""


    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        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						bool:

    """simple docstring"""


    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        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						bool:

    """simple docstring"""


    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        __SCREAMING_SNAKE_CASE (	)							->						str:

    """simple docstring"""


    __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 __future__ import annotations




def       A							(      _UpperCAmelCase   :				list[int]						,_UpperCAmelCase   :				int					)  ->				int:


  '''simple docstring'''




  __lowerCAmelCase     ,					__lowerCAmelCase		:    Dict			     =  0, len(_UpperCAmelCase					) - 1
  while start_ind <= end_ind:
    if array[start_ind] == search_item:
      return start_ind
    elif array[end_ind] == search_item:
      return end_ind
    else:
      start_ind += 1
      end_ind -= 1
    # returns -1 if search_item is not found in array
  return -1


if __name__ == "__main__":
    print(double_linear_search(list(range(1_00)), 40))





