/*
17D8101013F 森田　匡博
ID:key4 使用言語:C
*/

#include <stdlib.h>
#include <math.h>
#include <stdio.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) {
}

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; //一番最後になったらbreak
    }
    if(isf == 0) {
      printf(" ");
    }
    printf("%d", cur->key);
    cur = cur->next;
    isf = 0;
  }
  printf("\n");
}

void deleteNode(NodePointer t) {
  NodePointer pre = t->prev, nex = t->next;
  pre->next = nex;
  nex->prev = pre;
  free(t);
}

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

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

void delete(int key) {
  NodePointer t = nil->next;
  while(1) {
    if(t == nil) {
      break;
    }
    if(t->key == (unsigned int)key) {
      deleteNode(t);
      break;
    }
    t = t->next;
  }
}

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

int main()
{
  int key, n, i;
  int size = 0;
  char com[20];
  int np = 0, nd = 0;
  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{
	delete(key);
	nd++;
      }
      size--;
    }
  }

  printList();
  return 0;
}

