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

struct node{
  int key;
  struct node *n,*p;
};

struct node* nil;

struct node* search(int key){
  struct node* c;
  c=nil->n;
  while(c != nil && c->key != key){
    c=c->n;
  }
  return c;
}

void init(){
  nil=(struct node *)malloc(sizeof(struct node));
  nil->n=nil;
  nil->p=nil;
}

void printlist(){
  struct node* c;
  int ss;

  c=nil->n;
  ss=0;

  while(1){
    if(c == nil)break;
    if(ss++>0)printf(" ");
    printf("%d",c->key);
    c=c->n;
  }
  printf("\n");
}

void Dnode(struct node* t){
  if(t == nil)return;
  t->p->n=t->n;
  t->n->p=t->p;
  free(t);
}
void Dfirst(){
  Dnode(nil->n);
}

void Dlast(){
  Dnode(nil->p);
}

void Dkey(int key){
  Dnode(search(key));
}

void insert(int key){
  struct node *x =(struct node *)malloc(sizeof(struct node));
  x->key=key;
  x->n=nil->n;
  nil->n->p=x;
  nil->n =x;
  x->p=nil;
}

int main(){
  int key,i,n,ss;
  ss = 0;
  char s[20];
  int n1=0,n2=0;


  scanf("%d",&n);
  init();

  for(i=0;i<n;i++){
    scanf("%s",s);
    if(s[0] == 'i'){
      scanf("%d", &key);
      insert(key);
      n1++;
      ss++;
    }
    else if(s[0] == 'd'){
      if(strlen(s) > 6){
	if(s[6] == 'F')Dfirst();
	else if(s[6] == 'L')Dlast();
      }else{
	scanf("%d", &key);
	Dkey(key);
	n2++;
      }
      ss--;
    }
  }
  printlist();

  return 0;
}
 
