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

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

typedef struct node *NodePointer;
NodePointer nil;

NodePointer listSearch(int key){
  NodePointer c;
  c=nil->next;
  while(c!=nil&&c->key!=key){
    c=c->next;
  }
  return c;
}

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

void print(){
  NodePointer c;
  c=nil->next;
  int isf=0;
  while(1){
    if(c==nil) break;
    if(isf++>0)printf(" ");
    printf("%d",c->key);
    c=c->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(){
  deleteNode(nil->next);
}

void deleteLast(){
  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;
  x->prev=nil;
}

int main(){
  int key,n,i,size=0,np=0,nd=0;
  char com[20];

  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--;
    }
  }

  print();

  return 0;
  
}

