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

typedef struct Node
{
  int key;
  struct Node *next,*prev;
}Node;

Node *nl;

Node* listSearch(int key)
{
  Node *cu=nl->next;
  while(cu!=nl && cu->key !=key)
    {
      cu=cu->next;
    }
  return cu;
}

void init()
{
  nl=(Node *)malloc(sizeof(Node));
  nl->next=nl;
  nl->prev=nl;
}

void printlist()
{
  Node*cu=nl->next;
  int f=0;
  while(1)
    {
      if(cu==nl) break;
      if(f++>0)printf(" ");
      printf("%d",cu->key);
      cu=cu->next;
    }
  printf("\n");
}

void deleteNode(Node *r)
{
  if(r==nl)return;
  r->prev->next=r->next;
  r->next->prev=r->prev;
  free(r);
}

void deletefirst()
{
  deleteNode(nl->next);
}

void deletelast()
{
  deleteNode(nl->prev);
}

void deletekey(int key)
{
  deleteNode(listSearch(key));
}

void insert(int key)
{
  Node *a=(Node *)malloc(sizeof(Node));
  a->key=key;
  a->next=nl->next;
  nl->next->prev=a;
  nl->next=a;
  a->prev=nl;
}

int main()
{
  int key,i,n;
  int cnt=0;
  char order[20];
  int p=0,d=0;
  scanf("%d",&n);
  init();
  for(i=0;i<n;i++)
    {
      scanf("%s%d",order,&key);
      if(order[0]=='i')
	{
	  insert(key);
	  p++;
	  cnt++;
	}
      else if(order[0]=='d')
	{
	  if(strlen(order)>6)
	    {
	      if(order[6]=='F') deletefirst();
	      else if(order[6]=='L')deletelast();
	    }
	  else
	    {
	    deletekey(key);
	    d++;
	    }
	  cnt--;
	}
    }
  printlist();
  return 0;
}