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

#define MAX 100000

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

struct Node *nil;

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

struct Node* search(int key){
	struct Node *c;
	c=nil->next;
	while(c->key!=key){
		c=c->next;
		if(c==nil){
			return (nil);
		}
	}
	return(c);
}

void insert(int key){
	struct Node* x;
	x=(struct Node *)malloc(sizeof (struct Node));

	x->key=key;
	x->next=nil->next;
	x->next->prev=x;
	nil->next=x;
	x->prev=nil;
}

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

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

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

void printList(){
	struct Node *c;
	c=nil->next;
	while(c!=nil){
		printf("%d",c->key);
		c=c->next;
		if(c!=nil){
			printf(" ");
		}
	}
	printf("\n");
}

int main(){
	int i,n,key;
	char com[20];
	struct Node *c;

	scanf("%d",&n);
	init();
	for(i=0; i<n; i++){
		scanf("%s",com);
		if(com[0]=='i'){
			scanf("%d",&key);
			insert(key);
		}else if(com[0]=='d'){
			if(strcmp(com,"deleteFirst")==0){
				deleteFirst();
			}else if(strcmp(com,"deleteLast")==0){
				deleteLast();
			}else{
				scanf("%d",&key);
				c=search(key);
				delete(c);
			}
			
		}
	}
	printList();
	
	return 0;
}