#include<stdio.h>
#include<stdlib.h>
#include<string.h>

struct Node
{
	int key;
	struct Node *prev, *next;
};

struct Node *nil;

struct Node *listSearch(int key)
{
	struct Node *cur = nil->next;
	while(cur != nil && cur->key != key)
	{
		 cur = cur->next;
	}
	return cur;
}

void init()
{
	nil = (struct Node *)malloc(sizeof(struct Node));
	nil->next = nil;
	nil->prev = nil;
}

void printList()
{
	struct Node *cur =nil->next;
	int isf = 0;
	while(cur != nil)
	{
		if(isf++) putchar_unlocked(' ');
		printf("%d",cur->key);
		cur = cur->next;
	}
	putchar_unlocked('\n');
}


void deleteNode(struct Node *t)
{
	if(t ==nil) return;
	t->prev->next = t->next;
	t->next->prev = t->prev;
	free(t);
}

void deleteFirst()
{
	deleteNode(nil->next);
}

void deleteLast()
{
	deleteNode(nil->prev);
}

void deleteKey(int key)
{
	deleteNode(listSearch(key));
}


void insert(int key){
	struct Node *x = (struct Node *)malloc(sizeof(struct Node));
	x->key = key;
	x->next = nil->next;
	nil->next->prev = x;
	nil->next = x;
	x->prev = nil;
}

int main()
{
	int key,n,i;
	char com[20];
	nil = (struct Node*)malloc(sizeof(struct Node));
	nil->next = nil;
	nil->prev = nil;
	
	scanf("%d",&n);

	for(i=0;i<n;i++)
	{
		scanf("%s",com);
		if(strlen(com)>6)
		{
			if(com[6]=='F')
			{
				deleteFirst();
			}
			else
			{
				deleteLast();
			}
		}
		else
		{
			scanf("%d",&key);
			if(com[0] =='d')
			{
				deleteKey(key);
			}
			else
			{
				insert(key);
			}
		}
	}
	
	printList();
	
	return 0;
}
	
