#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)
{
  NodePointer n;
  /*for(n=nil;n->next != nil;n=n->next)
    {
      //printf("a\n");
      if(n->next->key == key)return n;
    }
    return NULL;*/
  n=nil->next;
  while(n!=nil&&n->key!=key)
    n=n->next;
    return n;
}

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

void printList(){
  NodePointer 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(NodePointer t)
{
  if(t!=nil)
    {
      //NodePointer delnode;
      /*delnode=t->next;
	t->next=delnode->next;
	free(delnode);*/
      t->prev->next=t->next;
      t->next->prev=t->prev;
      free(t);
    }
}

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

void deleteLast(){
  /* NodePointer n;
  //for(n=nil;n->next != nil;n=n->next);
  // n=nil->prev;
  n=nil->next;
  while(n->next!=nil)
    {
      
      n=n->next;
      printf("%d\n",n->key);
      }
      //printf("%d",nil->next->key);*/
  deleteNode(nil->prev);
}

void delete(int key)
{
  NodePointer n,delnode;
  if((n=listSearch(key)) != NULL)
    {     
      deleteNode(n);
    }
}


void insert(int key){
  NodePointer x;
  x = (struct node *)malloc(sizeof(struct node));
  x->key = key;
  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++;}
    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;
}

