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

struct node{
  unsigned int key;
  struct node *next;
  struct node *prev;
};

typedef struct node * NodePointer;

NodePointer nil;

NodePointer listSearch(int key){
  /* your code */

	NodePointer x;
	x = nil->next;
	while(x != nil && x->key != key){
		x = x->next;
	}
	return x;
}

/* リストの初期化 */
void init(){
  nil = malloc(sizeof(struct node));
  nil->next = nil;
  nil->prev = nil;
	nil->key = -1;
}

void printList(){
  NodePointer 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(NodePointer t){
  /* your code */
	if( t==nil ) return; //tが番兵の場合は処理しない
	t->prev->next = t->next;
	t->next->prev = t->prev;
	free(t);
}

void deleteFirst(){
	/* your code */
	deleteNode(nil->next);
}

void deleteLast(){
  /* your code */
	deleteNode(nil->prev);
}

void delete(int key){
  /* your code */
	deleteNode(listSearch(key));
}


void insert(int key){
	NodePointer x,y;
	x = malloc(sizeof(struct node));
	x->key = key;
  /* your code */
	x->next = nil->next;
	nil->next->prev = x;
	nil->next = x;
	x->prev = nil;
}

int main(){
	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++;}	//insert
		else if ( com[0] == 'd' ) {		//delete
			if (strlen(com) > 6){
				if ( com[6] == 'F' ) deleteFirst();	//deleteFirst
				else if ( com[6] == 'L' ) deleteLast();	//deleteLast
			} else {
				delete(key); nd++; 
			}
 			size--;
		}
	}

	printList();
	return 0;
}
