"""simple docstring"""
def 						__a       (     _SCREAMING_SNAKE_CASE       )     ->bool:
  a__:					Optional[Any]      							=     n ** (1 / 3)
  return (val * val * val) == n


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



"""simple docstring"""
from __future__ import annotations




class        __snake_case	:



      def __init__(						self   ,      lowercase=None)     ->      Optional[Any]:





        '''simple docstring'''





        a__:					int      							=     data
        a__:					str      							=     None



      def __repr__(						self)     ->      List[str]:





        '''simple docstring'''





        a__:					Optional[Any]      							=     []
        a__:					Union[str, Any]      							=     self
        while temp:
          string_rep.append(f'{temp.data}')
          a__:					Tuple      							=     temp.next
        return "->".join(lowercase)







def 						__a       (     _SCREAMING_SNAKE_CASE       )     ->str:
  if not elements_list:
    raise Exception('The Elements List is empty'       )

  a__:					Any      							=     Node(elements_list[0]       )
  for i in range(1		,					len(_SCREAMING_SNAKE_CASE       )       ):
    a__:					Optional[Any]      							=     Node(elements_list[i]       )
    a__:					Tuple      							=     current.next
  return head







def 						__a       (     _SCREAMING_SNAKE_CASE       )     ->None:
  if head_node is not None and isinstance(_SCREAMING_SNAKE_CASE		,					_SCREAMING_SNAKE_CASE       ):
    print_reverse(head_node.next       )
    print(head_node.data       )







def 						__a       (     )     ->Optional[Any]:
  from doctest import testmod

  testmod()

  a__:					Tuple      							=     make_linked_list([14, 52, 14, 12, 43]       )
  print('Linked List:'       )
  print(_SCREAMING_SNAKE_CASE       )
  print('Elements in Reverse:'       )
  print_reverse(_SCREAMING_SNAKE_CASE       )


if __name__ == "__main__":
 main()


