#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node{
  unsigned int key;
  struct node *next;
  struct node *prev;
} Node;

Node *nil;

Node *listSearch(int key){
  Node *now =nil->next;
  while (now !=nil && now->key !=key)
    {
      now = now->next;
    }
  return now;
  
}

void init(){
  nil =(Node *)malloc(sizeof(Node));
  nil->next = nil;
  nil->prev = nil;
}

void printList(){
  Node *cur = nil->next;
  int isf = 0;
  while(1){
    if ( cur == nil ) break;
    if ( isf++ > 0)  printf(" ");
    printf("%d", cur->key);
    cur = cur->next;
  }
  printf("\n");
}

void deleteNode(Node *t){
  
  if(t==nil) return ;
  t->prev->next =t->next;
  t->next->prev =t->prev;
  free(t);
}



void deleteFirst(){
  deleteNode(nil->next);
}


void deleteLast(){
  deleteNode(nil->prev);
}

void deletekey(int key){
  deleteNode (listSearch(key));
}


void insert(int key){
  Node *x=(Node *) malloc(sizeof(struct node));
  x->key = key;
  x->next =nil->next;
  nil->next->prev =x;
  nil->next =x;
  x->prev =nil;

}

int main(){
  int key, n, i;
  int size = 0;
  char com[20],b[20]="insert",c[20]="delete",d[20]="deleteFirst",e[20]="deleteLast";
  int np = 0, nd = 0;
  scanf("%d", &n);
  init();
  for ( i = 0; i < n; i++ ){
    scanf("%s",com);
    if ( strcmp(com,b)==0 ) {
       scanf("%d",&key);
      insert(key);
      np++;
      size++;
    }
    else if ( strcmp(com,c)==0 )
      { scanf("%d",&key);
	deletekey(key);
	nd++;
	size--;
      }
    else if (strcmp(com,d)==0 )
      {
	deleteFirst();
	size--;
      }
    else if (strcmp(com,e)==0 )
      {
	deleteLast();
	size--;
      }
  }
  
  printList();
  return 0;
}

