#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 2000000

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

Node *nil;

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

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

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

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

int main(){

  int i, n, m=0, key=0;
  char str[12];
  Node *cur = nil->next;

  scanf("%d", &n);
  init();
  for(i=0; i<n; i++){
    scanf("%s", str);
    if(str[0] == 'i'){
      scanf("%d", &key);
      insert(key);
    }
    if(str[0] == 'd'){
      if(strlen(str) > 6){
        if(str[6] == 'F') deleteFirst();
        else if(str[6] == 'L')deleteLast();
      } else {
        scanf("%d", &key);
        deleteKey(key);
      }
    }
  }
  while(1){
    if(cur == nil) break;
    if(m++ > 0) printf(" ");
    printf("%d", cur->key);
    cur = cur->next;
  }
  printf("\n");

  return 0;
}