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

struct node
{
  unsigned int key; //0以上の整数値
  struct node *next;
  struct node *prev;
};

typedef struct node * NodePointer;

NodePointer nil;

NodePointer listSearch(int key)
{
  NodePointer n;

  for( n = nil->next; n != nil; n = n->next)
    {
      if(n->key == key) return n;
    }
  return NULL;
}

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)
{
  free(t);
}

void delete(int key)
{
  NodePointer x;
  if((x = listSearch(key)) == NULL)return;

  x->next->prev = x->prev;
  x->prev->next = x->next;
  deleteNode(x);
}


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

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

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

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

}

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", com);
      
      if ( com[0] == 'i' )
	{
	  scanf("%d", &key);
	  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
	    {
	      scanf("%d",&key);
	      delete(key); nd++; 
	    }
	  size--;
	}
    }
  
  printList();
  
  return 0;
}

