#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);
void init(void);
void printList(void);
void deleteNode(NodePointer);
void deleteFirst(void);
void deleteLast(void);
void delete(int);
void insert(int);


int main() {
  int key, n, i, size=0, 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 {
	delete(key);
	nd++; 
      }
      size--;
    }
  }

  printList();
 
  return 0;
}
NodePointer listSearch(int key) {
  NodePointer 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;
}

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) {
  if ( t == nil ) return;
  t->prev->next = t->next;
  t->next->prev = t->prev;
  free(t);
}

void deleteFirst() {
  NodePointer t = nil->next;
  
  if ( t == nil ) return;
  deleteNode(t);
}

void deleteLast() {
  NodePointer t = nil->prev;
  
  if ( t == nil ) return;
  deleteNode(t);
}

void delete(int key) {
  NodePointer t = listSearch(key);
  
  deleteNode(t);
}


void insert(int key) {
  NodePointer x;
  
  x = malloc(sizeof(struct node));
  x->key = key;

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

