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


typedef struct node {long int item; struct node *next;} link;


link *insert(link *nxt,long int item){
 link *A;
 A =malloc(sizeof(link));
 A->item = item;
 A-> next =nxt;
 return A;
}


link *deleteFirst(link *B){
 link *A;
 A=B->next;
 free(B);
 return A;
}


link *delete(link *B,long int key){
 link *A,*C;
 A=B;
 C=B;
 if(B->item == key){
 B=deleteFirst(B);
 C=B;
}else{
 while(B ->next != NULL && B->item != key){
 A=B;
 B = B ->next;
 }

 if (B->item==key){
 A->next=A->next->next;
 free(B);
}}
 return C;
}


link *deleteLast(link *B){
 link *A,*C;
 C = B;
 while(B->next != NULL){
 A=B;
 B = B->next;
 }
 A->next = NULL;
 free(B);
 return C;
}
int main(void){
int n;
long int B;
char A[50];
char *s1 = "insert";
char *s2 = "delete";
char *s3 = "deleteFirst";
char *s4 = "deleteLast";

link *head;
 head =NULL;


scanf("%d",&n);

for (int i=0;i<n;i++){
 scanf("%s",A);

 if(strcmp(s1,A)==0){
 scanf("%ld",&B);
  head=insert(head,B);
 }
 if(strcmp(s2,A)==0){
  scanf("%ld",&B);
  head=delete(head,B);
 }
 if(strcmp(s3,A)==0){
  head=deleteFirst(head);
 }
 if(strcmp(s4,A)==0){
  head=deleteLast(head);
 }
}


printf ("%ld",head->item);
link *First;
First = head->next;

while(First !=NULL){
 printf(" %ld",First->item);
 First = First->next;
}
 printf("\n");
return 0;
}