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

struct node{
  struct node *next;
  struct node *prev;
  unsigned int key;
};

typedef struct node *Nodepointer;

Nodepointer nil;

Nodepointer listsearch(int);
void init(void);
void printList(void);
void deleteNode(Nodepointer);
void deleteFirst(void);
void deleteLast(void);
void delete(int);
void insert(int);



int main(){
  int key,n,i;
  int size = 0;
  char com[20];
  int np=0 , nd=0;
  scanf("%d",&n);
  init();
  for(i=0;i<n;i++){
    scanf("%s %d",com,&key);
    if(com[0] == 'i'){insert(key); np++; size++;}
    else if(com[0] == 'd'){
      if(strlen(com) > 6){
	if(com[6] == 'F') deleteFirst();
	else if(com[6] == 'L') deleteLast();
      } else {
	  delete(key); nd++;
      }
      size--;
    }
  }

    printList();
    return 0;
}



void init(){
  nil = malloc(sizeof(struct node));
  nil->next = nil;
  nil->prev = nil;
}


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


void deleteNode(Nodepointer t){
  t->prev->next = t->next;
  t->next->prev = t->prev;
  free(t);
}

void deleteFirst(){
  Nodepointer t = nil->next;
  if(t == nil){
    return;
  }
  deleteNode(t);
}

void deleteLast(){
  Nodepointer t = nil->prev;
  if(t == nil){
    return;
  }
  deleteNode(t);
}

void delete(int key){
  Nodepointer t=listsearch(key);
  if(t == NULL){
    return;
  }
  deleteNode(t);
}

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

Nodepointer listsearch(int key){
  Nodepointer cur;
  for(cur = nil->next;cur!=nil;cur=cur->next){
    if(cur->key == key){
      return cur;
    }
  }
  return NULL;
}

