#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct list{
  struct list *next;
  struct list *prev;
  int data;
};
struct list *nil;				/* 番兵 */

void init(){
  nil=malloc(sizeof(struct list));
  nil->prev=nil;
  nil->next=nil;
}
void insert(int x){
  struct list *tmp;
  tmp=malloc(sizeof(struct list));
  tmp->data=x;
  nil->next->prev=tmp;
  tmp->next=nil->next;
  nil->next=tmp;
  tmp->prev=nil;
}
struct list *listsearch(int x){
  struct list *tmp=nil->next;
  while((tmp!=nil)&&(tmp->data!=x))
	tmp=tmp->next;
  return tmp;
}
void delete(struct list *cur){
  if(cur == nil)
	return;
  cur->next->prev=cur->prev;
  cur->prev->next=cur->next;
  free(cur);
}
void deletelist(int x){
  delete(listsearch(x));
}
void deletefirst(){
  delete(nil->next);
}
void deletelast(){
 delete(nil->prev);
}
void printlist(){
  struct list *cur=nil->next;
  int x=0;
  while(1){
	if(cur==nil)
	  break;
	if(x>0)
	  printf(" ");
	++x;
	printf("%d", cur->data);
	cur=cur->next;
}
  printf("\n");
}
int main(){
  int n;
  scanf("%d", &n);
  int i;
  char line[100];
  int num;
  init();
  for(i=0; i<n; ++i){
	scanf("%s %d", line, &num);
	if(strcmp(line, "insert")==0)
	  insert(num);
	else if(strcmp(line, "delete")==0)
	  deletelist(num);
	else if(strcmp(line, "deleteFirst")==0)
	  deletefirst();
	else if(strcmp(line, "deleteLast")==0)
	  deletelast();
	  }
   printlist();
  return 0;
}

