


'''simple docstring'''

def _SCREAMING_SNAKE_CASE				(A  ,			A  ,			A	)	->	int:






       """simple docstring"""







       if power < 0:
              return -1
       base %= mod
       lowercase__				      =			1

       while power > 0:
              if power & 1:
                     lowercase__				      =			(result * base) % mod
              lowercase__				      =			power >> 1
              lowercase__				      =			(base * base) % mod

       return result

def _SCREAMING_SNAKE_CASE				()	->	Any:






       """simple docstring"""







       print(modular_exponential(3  ,			200  ,			13	)	)


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 main()








'''simple docstring'''

def _SCREAMING_SNAKE_CASE				(A	)	->	list:






       """simple docstring"""







       lowercase__				      =			len(A	)

       # Set the gap value to be decreased by a factor of 1.3
       # after each iteration
       lowercase__				      =			1.3

       # Continue sorting until the gap is 1
       while gap > 1:
              # Decrease the gap value
              lowercase__				      =			int(gap / shrink	)

              # Sort the elements using insertion sort
              for i in range(A  ,			len(A	)	):
                     lowercase__				      =			collection[i]
                     lowercase__				      =			i
                     while j >= gap and collection[j - gap] > temp:
                            lowercase__				      =			collection[j - gap]
                            j -= gap
                     lowercase__				      =			temp

       return collection


if __name__ == "__main__":
 import doctest

 doctest.testmod()




