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

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

Node *nil;

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

void init(){
  nil = (Node *)malloc(sizeof(Node));
  nil->next = nil;
  nil->prev = nil;
}

void printlist(){
  Node *cur = nil->next;
  int m = 0;
  while(1){
    if(cur == nil) break;
    if(m++ > 0) printf(" ");
    printf("%d", cur->key);
    cur = cur->next;
  }
  printf("\n");
}

void deleteNode(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));
}

void insert(int key){
  Node *x = (Node *)malloc(sizeof(Node));
  x->key = key;
  x->next = nil->next;
  nil->next->prev = x;
  nil->next = x;
  x->prev = nil;
}

int main(){
  int n, i, key;
  char str[20];

  scanf("%d", &n);
  init();
  for(i=0; i<n; i++){
    scanf("%s%d", str, &key);
    if(str[0] == 'i') insert(key);
    else if(str[0] == 'd'){
      if(strlen(str) > 6){
        if(str[6] == 'F') deleteFirst();
        else if(str[6] == 'L') deleteLast();
      } else {
        deleteKey(key);                                                                          
      }                                                                        
    }
  }

  printlist();

  return 0;
}