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

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

typedef struct node * NodePointer;

NodePointer nil;

NodePointer listSearch(int key){
  NodePointer n;
  for(n=nil;n->next != nil; n=n->next){
    if(n->next->key==key) return n;
  }
  return NULL;
}

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

void printList(){
  NodePointer 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 deleteNode(NodePointer t){
  if(t==nil->next){
    nil->next=t->next;
    t->next->prev=nil;
  }else if(t==nil->prev){
    nil->prev=t->prev;
    t->prev->next=nil;
  }
  free(t);
}

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

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

void delete(int key){
  NodePointer n,delnode;
  if((n=listSearch(key))!=NULL){
    delnode=n->next;
    n->next=delnode->next;
    delnode->next->prev=n;
    free(delnode);
  }else return;
}


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

int main(){
  int n, i,key,j;
  char k[10];
  int size = 0;
  char com[20];
  int np = 0, nd = 0;
  scanf("%d", &n);
  init();
  for ( i = 0; i < n; i++ ){
    scanf("%s", com);
    if ( com[0] == 'i' ) {
      scanf("%s",k);
      key=k[0]-'0';
      for(j=1;k[j]!=0;j++){
        key=key*10;
        key+=k[j]-'0';
      }
      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 {
        scanf("%s",k);
        key=k[0]-'0';
        for(j=1;k[j]!=0;j++){
          key=key*10;
          key+=k[j]-'0';
        }
        delete(key);
        nd++; 
      }
      size--;
    }
  }
  
  printList();
  return 0;
}

