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

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

struct Node *nil;

void init();//双方向リストの初期化
void insert(int);
struct Node* listSearch(int );
void deleteNode(struct Node *);
void deleteFirst();
void deleteLast();
void deleteKey(int );

int main(){
  int key,n,i,size=0,p=0,d=0;
  char com[25];
  scanf("%d",&n);
  init();
  for(i=0;i<n;i++){
    scanf("%s%d",com,&key);
    if(com[0]=='i'){
      insert(key);
      p++;
      d++;
    }
    else if(com[6]=='F')
      deleteFirst();
    else if(com[6]=='L')
      deleteLast();
    else{ deleteKey(key);
      d++;
    }
  size--;
  }
  struct Node *cur=nil->next;
  int f=0;
  while(1){
    if(cur==nil)break;
    if(f++>0)printf(" ");
    printf("%d",cur->key);
    cur=cur->next;
  }
  printf("\n");


  return 0;
}
void init(){
  nil=(struct Node*)malloc(sizeof(struct Node));
  nil->next=nil;
  nil->prev=nil;
}
void insert(int key){
  struct Node *x=(struct Node*)malloc(sizeof(struct Node));
  x->key =key;
  x->next=nil->next;
  nil->next->prev=x;
  nil->next=x;
  x->prev=nil;
}
struct Node* listSearch(int key){
  struct Node *cur=nil->next;
  while(cur!=nil&&cur->key!=key)
    cur=cur->next;
  return cur;
}
void deleteNode(struct 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));
}

