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

#define N 2000000

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

struct node *head;
struct node *tail;

void insert(int key) {
  struct node *ptr;
  ptr = (struct node*)malloc(sizeof(struct node));
  ptr -> key = key;
  ptr -> next = head -> next;
  ptr -> prev = head;
  head -> next -> prev = ptr;
  head -> next = ptr;
  return;
}

void delete(int key) {
  struct node *ptr, *tmp;
  for (ptr = head; ptr -> next != NULL; ptr = ptr -> next) {
    if (ptr -> next -> key == key) {
      tmp = ptr -> next;
      ptr -> next -> next -> prev = ptr;
      ptr -> next = ptr -> next -> next;
      free(tmp);
      return;
    }
  }
  return;
}

void deleteFirst() {
  struct node *tmp = head -> next;
  head -> next -> next -> prev = head;
  head -> next = head -> next -> next;
  free(tmp);
  return;
}

void deleteLast() {
  struct node *tmp = tail -> prev;
  tail -> prev -> prev -> next = tail;
  tail -> prev = tail -> prev -> prev;
  free(tmp);
  return;
}

int main(){
  
  int i, n, a;
  char str[12];
  struct node *ptr;
  
  head = malloc(sizeof(struct node));
  tail = malloc(sizeof(struct node));
  head -> next = tail;
  head -> prev = NULL;
  tail -> prev = head;
  tail -> next = NULL;
  
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%s", str);
    if (strcmp(str, "insert") == 0) {
      scanf("%d", &a);
      insert(a);
      continue;
    }
    if (strcmp(str, "delete") == 0) {
      scanf("%d", &a);
      delete(a);
      continue;
    }
    if (strcmp(str, "deleteFirst") == 0) {
      deleteFirst();
      continue;
    }
    if (strcmp(str, "deleteLast") == 0) {
      deleteLast();
      continue;
    }
  }
  
  for (ptr = head -> next; ptr -> next -> next != NULL; ptr = ptr -> next) {
    printf("%d ", ptr -> key);
  }
  printf("%d\n", ptr -> key);
  
  return 0;
}

