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

struct Node{
  int key;
  struct Node *next,*pre;
};

struct Node *n;

struct Node* lserch(int key){
  struct Node *cur=n->next;
  while(cur != n && cur->key != key){
    cur=cur->next;
  }
  return cur;
}

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

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

void delete(struct Node *t){
  if(t==n) return;
  t->pre->next = t->next;
  t->next->pre = t->pre;
}

void delete2(){
  delete(n->next);
}

void delete3(){
  delete(n->pre);
}

void deletekey(int key){
  delete(lserch(key));
}

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

int main(int argc, char const *argv[]) {
  int key,n,i;
  int size=0;
  char s[20];
  int np=0,nd=0;
  scanf("%d",&n);
  init();
  for (i = 0; i < n; i++) {
    scanf("%s%d",s,&key);
    if(s[0]=='i'){
      insert(key);
      np++;
      size++;
    }else if(s[0]=='d'){
      if(strlen(s)>6){
        if(s[6]=='F') delete2();
        else if(s[6]=='L')delete3();
      }else{
        deletekey(key);
        nd++;
      }
      size--;
    }
  }
  list();
  return 0;
}