from collections import deque
d= deque()
N = int(input())

for inp in range(N):
    operation = input().split()
    if len(operation) == 1:
        getattr(d, operation[0])()
    else:
        getattr(d, operation[0])(operation[1])

print(" ".join(d))

    

# Enter your code here. Read input from STDIN. Print output to STDOUT
from collections import deque
d = deque()
for _ in range(int(input())):
    function = input().split()
    match function[0]:
        case "append":
            d.append(int(function[1]))
        case "pop":
            d.pop()
        case "popleft":
            d.popleft()
        case "appendleft":
            d.appendleft(int(function[1]))
print (" ".join(map(str,d)))

if __name__ == '__main__':
    from collections import deque
    operation_count = int(input())
    que = deque()
    for _ in range(operation_count):
        operation = str(input()).split(" ")
        if operation[0] == 'append':
            que.append(operation[1])
        if operation[0] == 'appendleft':
            que.appendleft(operation[1])
        if operation[0] == 'pop':
            que.pop()
        if operation[0] == 'popleft':
            que.popleft()
            
    for value in que:
        print(value, end=" ")

from collections import deque

d = deque()

for _ in range(int(input())):
    op, *args = input().rsplit()
    getattr(d, op)(*args)

print(*d)