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

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

struct Node *nil;

struct Node *listSearch(int key);
void init();
void printList();
void deleteFirst();
void deleteLast();
void deleteKey(int key);
void deleteNode(struct Node *t);
void insert(int key);


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

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


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

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

 

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

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

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

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

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

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

