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

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

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 deleteKey(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 {
        deleteKey(key);
        nd++;
      }
      size--;
    }
  }

  printList();

  return 0;
}

NodePointer listSearch(int key){
  NodePointer cur;

  cur = nil->next;

  while(cur != nil && cur->key != key){
    cur = cur->next;
  }

  return cur;
}

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

void printList(void){
  NodePointer cur;
  int isf = 0;
  
  cur = nil->next;

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

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

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

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

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

void insert(int key){
  NodePointer x;

  x = (NodePointer)malloc(sizeof(struct node));
  x->key = key;

  x->next = nil->next;
  nil->next->prev = x;
  nil->next = x;
  x->prev = nil;
}

