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

 struct  Node{
  int key;
  struct Node *next, *pre;
};
typedef struct Node *NodePointer; 

NodePointer nil;

void insert( int);
void del( NodePointer t);

int main(){
  int k,n, i ,inpn=0;
  NodePointer j;
  scanf("%d",&n);
  char command[12];
  nil = ( NodePointer )malloc( sizeof( int ) + sizeof ( int *)*2);
  nil->pre =nil;  nil->next =nil;


  for ( i = 0; i < n;i++){
    scanf("%s%d" ,command , &k);
    if ( strcmp(command, "insert") == 0){ insert( k);}
    else if (  strcmp(command, "delete") == 0 ){
      for( j = nil -> next ; j != nil ;j = j-> next){
	if ( j-> key== k){break;}
      }
        del ( j); }
    else if (  strcmp(command, "deleteFirst") == 0){ del ( nil ->next) ;}
    else if (  strcmp(command, "deleteLast") == 0){  del ( nil -> pre) ;}

  }



  NodePointer nf;
  for ( nf = nil ->next ; nf != nil ; nf = nf -> next){
    printf("%d" ,nf ->key );
    if ( nf->next != nil){ printf(" ");}
  }
  
  printf("\n");
  return 0;
}


void insert ( int k){
  NodePointer x;
  x = ( NodePointer)malloc(sizeof( int ) + sizeof ( int *)*2);
  x->key = k;
  x -> next = nil -> next ;
  nil -> next -> pre = x;
  nil -> next =x;
  x -> pre =nil;
  
}


void del( NodePointer tag){
  if ( tag== nil ){return ;}
  tag -> next -> pre = tag -> pre;
  tag ->pre ->next = tag -> next;
  free(tag);
}
