

def 				UpperCAmelCase_   (						_A      ,		_A      ,		_A = 0      ,		_A = 0				):





     '''simple docstring'''




     SCREAMING_SNAKE_CASE__    =    right or len(_A				) - 1
     if left > right:
          return -1
     elif list_data[left] == key:
          return left
     elif list_data[right] == key:
          return right
     else:
          return search(_A      ,		_A      ,		left + 1      ,		right - 1				)


if __name__ == "__main__":
       import doctest

       doctest.testmod()









'''simple docstring'''







def  _lowerCamelCase				( lowercase						:      int						)	->	bool:
				_a								= n ** (1 / 3)
				return (val * val * val) == n


if __name__ == "__main__":
					print(perfect_cube(27))
					print(perfect_cube(4))
