#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 iter = nil->next;
  while (iter != nil) {
    if (key == iter->key) {
      return iter;
    }
    iter = iter->next;
  }

  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) {
  NodePointer del = listSearch(t->key);
  if (del == NULL) {
    return;
  }
  NodePointer a_del, b_del;

  b_del = del->prev;
  a_del = del->next;
  if (a_del == nil) {
    b_del->next = nil;
  } else {
    b_del->next = a_del;
    a_del->prev = b_del;
  }
  free(del);
  return;
}

void deleteFirst() {
  NodePointer t = nil->next;
  NodePointer a_del = t->next;

  a_del->prev = nil;
  nil->next = a_del;
  free(t);
}

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

  nil->prev = t->prev;
  nil->prev->next = nil;
  free(t);
}

void delete(int key) {
  NodePointer t = listSearch(key);
  if (t == NULL) return;
  deleteNode(t);
}


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

  nil->next->prev = x;
  x->next = nil->next;
  nil->next = x;
  x->prev = nil;
}

int main(void) {
  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", com);
    if ( com[0] == 'i' ) {
      scanf("%d", &key);
      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("%d", &key);
        delete(key); nd++;
      }
      size--;
    }
  }

  printList();
  return 0;
}