# stack = []

# def isEmpty(stack):
#     if len(stack) !=0 :
#         return "stack is not empty"
#     else:
#         return "stack is empty"


# def insert_stack(stack,element):
#     stack.append(element)

# def remove_stack(stack):
#     stack.pop()

# def print_stack(stack):
#     return stack

# def top_most(stack):
#     return stack[len(stack)-1]
