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

typedef struct node{
	int key;
	struct node *prev;
	struct node *next;
}*Node;

Node nil;

Node listSearch( int );
void init();
void printList();
void deleteNode( Node );
void deleteFirst();
void deleteLast();
void deleteKey( int );
void insert( int );

int main( void ){
	int key, n, i;
	int size = 0;
	char com[20];
	int np = 0, nd = 0;

	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;
}

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

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

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

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

void deleteFirst(){
	Node t = nil->next;
	if( t != nil ){
		deleteNode(t);
	}
}

void deleteLast(){
	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;
}
