# Original solution
import sys

class Node:
	def __init__(self, value):
		self.value = value
		self.prev = None
		self.next = None

class DoublyLinkedList:
	def __init__(self):
		self.head = None
		self.tail = None
		self.size = 0

	def get_size(self):
		return self.size

	def is_empty(self):
		return self.size == 0

	def insert(self, value):
		node = Node(value)
		if self.is_empty():
			self.head = self.tail = node
		else:
			self.head.prev = node
			node.next = self.head
			self.head = node
		self.size += 1

	def deleteFirst(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.head = self.head.next
			self.head.prev = None
		self.size -= 1
	
	def deleteLast(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.tail = self.tail.prev
			self.tail.next = None
		self.size -= 1

	def delete(self, value):
		if self.is_empty():
			return
		if self.head.value == value:
			self.deleteFirst()
		else:
			node1 = self.head.next
			node2 = self.tail
			node3 = None
			while node1 != None:
				if node1.value == value:
					prev = node1.prev
					next = node1.next
					prev.next = next
					if next != None:
						next.prev = prev
					else:
						self.tail = prev
					self.size -= 1
					break
				elif node1 == node2:
					if node3 == None:
						break;
					else:
						node1 = node3
				else:
					node1 = node1.next
					if node2.value == value:
						node3 = node2
					node2 = node2.prev
		return

	def print(self):
		node = self.head
		while node != None:
			sys.stdout.write(str(node.value))
			node = node.next
			if node != None:
				sys.stdout.write(' ')
		print()

n = int(input())
dll = DoublyLinkedList()
for i in range(n):
	cmd = str(input())
	if cmd == 'deleteFirst':
		dll.deleteFirst()
	elif cmd == 'deleteLast':
		dll.deleteLast()
	else:
		cmd, value = cmd.split()
		if cmd == 'insert':
			dll.insert(int(value))
		else:
			dll.delete(int(value))
dll.print()



# Optimized solution
import sys

class Node:
	def __init__(self, value):
		self.value = value
		self.prev = None
		self.next = None

class DoublyLinkedList:
	def __init__(self):
		self.head = None
		self.tail = None
		self.size = 0

	def get_size(self):
		return self.size

	def is_empty(self):
		return self.size == 0

	def insert(self, value):
		node = Node(value)
		if self.is_empty():
			self.head = self.tail = node
		else:
			self.head.prev = node
			node.next = self.head
			self.head = node
		self.size += 1

	def deleteFirst(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.head = self.head.next
			self.head.prev = None
		self.size -= 1
	
	def deleteLast(self):
		if self.is_empty():
			return
		if self.size == 1:
			self.head = self.tail = None
		else:
			self.tail = self.tail.prev
			self.tail.next = None
		self.size -= 1

	def delete(self, value):
		if self.is_empty():
			return
		if self.head.value == value:
			self.deleteFirst()
		else:
			node1 = self.head.next
			node2 = self.tail
			node3 = None
			while node1 != None:
				if node1.value == value:
					prev = node1.prev
					next = node1.next
					prev.next = next
					if next != None:
						next.prev = prev
					else:
						self.tail = prev
					self.size -= 1
					break
				elif node1 == node2:
					if node3 == None:
						break;
					else:
						node1 = node3
				else:
					node1 = node1.next
					if node2.value == value:
						node3 = node2
					node2 = node2.prev
		return

	def print(self):
		node = self.head
		while node != None:
			sys.stdout.write(str(node.value))
			node = node.next
			if node != None:
				sys.stdout.write(' ')
		print()

n = int(input())
dll = DoublyLinkedList()
for n in range(n):
	cmd = sys.stdin.readline().strip().split()
	if cmd[0] == 'deleteFirst':
		dll.deleteFirst()
	elif cmd[0] == 'deleteLast':
		dll.deleteLast()
	else:
		if cmd[0] == 'insert':
			dll.insert(int(cmd[1]))
		else:
			dll.delete(int(cmd[1]))
dll.print()