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


typedef struct{
  int key;
} node;

typedef struct{
  int key;
  node *next;
  node *prev;
}Node;


Node *nil;

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

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

void plist(void){
  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 ddd(Node *t){
  if(t==nil) return;
  t->prev->next = t->next;
  t->next->prev = t->prev;
  free(t);
}

void insert(int key){
  Node *x = (Node *)malloc(sizeof(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, np=0, nd=0;
  char com[20];

  scanf("%d",&n);
  iii();
  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')
          ddd(nil->next);
        else if(com[6]=='L')
          ddd(nil->prev);
      } else {
        ddd(listSearch(key));
        nd++;
      }
      size--;
    }
  }
  plist();
  return 0;
}