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

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

typedef struct node *NP;

NP listsearch(int);
void init();
void printlist();
void delenode(NP);
void delfirst();
void dellast();
void delkey(int);
void insert(int);

NP nil;



int main(){
  int key, n, i, 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') delfirst();
        else if(com[6]=='L') dellast();
      } else {
        delkey(key);
        nd++;
      }
      size--;
    }
  }

  printlist();

return 0;
}

NP listsearch(int key){
  NP cur = nil->next;
  while(cur!=nil && cur->key!=key){
    cur = cur->next;
  }
  return cur;
}

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

void printlist(){
  NP 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 delenode(NP t){
  if(t==nil) return;
  t->prev->next=t->next;
  t->next->prev=t->prev;
  free(t);
}

void delfirst(){
  NP t = nil->next;
  if(t==nil) {
    return;
  }
  delenode(t);
}

void dellast(){
  NP t = nil->prev;
  if(t==nil) {
    return;
  }
  delenode(t);
}

void delkey(int key){
  delenode(listsearch(key));
}

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