#include<cstdio>
#include<cstdlib>
#include<cstring>

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

Node *nil;

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

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

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

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

void deleteFirst()
{
  deleteNode(nil->next);
}

void deleteLast()
{
  deleteNode(nil->prev);
}

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

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

int main()
{
  char com[20];
  int np=0, nd=0, n, key, i, size=0;
  scanf("%d", &n);
  init();
  for(i=0; i<n; i++)
  {
    scanf("%s", com);
    if(strlen(com) <= 6)
      scanf("%d", &key);
    if(com[0] == 'i')
    {
      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
      {
        deleteKey(key); nd++;
      }
      size--;   //When key doesn't exist, this can cause size minus 1 by mistake.
    }
  }

  printList();
  return 0;
}

