def push(stack,e): stack.append(e) def pop(stack): return stack.pop()

def is_empty(stack): return len(stack)==0 def is_palindrome(arr): stack=[] for i in arr: push(stack,i) for i in arr: if pop(stack)!=i: return False return True