#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define LEN 13 

typedef struct _list list;
struct _list {
   int key;
   struct _list *prev, *next;
} ;

list *create_list(int key);
list *insert(int key);
void delete(int key);
void deleteFirst(void);
void deleteLast(void);
void print_list(void);
void destroy_list(void);

list *head, *tail;

int main(){
   int i, n, key;
   char cmd[LEN];
   head=NULL;
   tail=NULL;
   scanf("%d",&n);
   for(i=0;i<n;i++){
      scanf("%s %d",cmd,&key);
      if(strcmp(cmd,"insert")==0) insert(key);
      else if(strcmp(cmd,"delete")==0) delete(key);
      else if(strcmp(cmd,"deleteFirst")==0) deleteFirst();
      else if(strcmp(cmd,"deleteLast")==0) deleteLast();
//      print_list();
   }
   print_list();
   destroy_list();
   return 0;
}

list *create_list(int key){ 
   list *tmp;
   tmp=malloc(sizeof(list));
   tmp->prev=NULL;
   tmp->next=NULL;
   tmp->key=key;
   return tmp;
}

list *insert(int key){
   list *p;
   p=create_list(key);
   if(head!=NULL) head->prev=p;
   p->next=head;
   head=p;
   if(tail==NULL) tail=p;
   return p;
}

void delete(int key){
   list *p;
   p=head;
   while(p!=NULL){
      if(p->key==key){
         if(p==head) deleteFirst();
         else if(p==tail) deleteLast();
         else {
            if(p->prev!=NULL) (p->prev)->next=p->next;
            if(p->next!=NULL) (p->next)->prev=p->prev;
            free(p);
         }
         break;
      }
      p=p->next;
   }
}

void deleteFirst(void){
   list *new_head;
   if((new_head=head->next)!=NULL) new_head->prev=NULL;
   free(head);
   head=new_head;
}

void deleteLast(void){
   list *new_tail;
   if((new_tail=tail->prev)!=NULL) new_tail->next=NULL;
   free(tail);
   tail=new_tail;
}

void print_list(void){
   list *p;
   p=head;
   while(p!=NULL){
      if(p->next==NULL){
         printf("%d\n",p->key);
      } else {
         printf("%d ",p->key);
      }
      p=p->next;
   }
}

void destroy_list(void){
   while(head!=NULL){
      deleteFirst();
   }
}