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

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

Node *nil;

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

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

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

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

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

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

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

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

int main(void){
	int key, n, i;
	int size =0;
	int np =0, nd =0;
	char com[20];
	scanf("%d", &n);
	init();
	for(i=0;i<n;i++){
		scanf("%s %d", com, &key);
		if(com[0]=='i'){
			insert(key);
			np++;
			size++;
		}	
		else if(com[0] == 'd'){
			if(strlen(com)>6){
				if(com[6]=='F') deleteFirst();
					else if(com[6]=='L') deleteLast();
			}
			else{
				deletekey(key);
				nd++;
			}
		size--;
		}
	}
	printList();
	return 0;
}
