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

struct element {
  int key;

  struct element *fp;
  struct element *bp;
};

struct element list;

void insert(int x);
void delete(int x);
void deleteFirst();
void deleteLast();

int main(int argc, char *argv[])
{
  int n, i;
  char cmd[11 + 3];
  int x;
  struct element *p;

  list.fp = &list;
  list.bp = &list;

  scanf("%d", &n);

  for (i = 0; i < n; i++) {
    scanf("%s", cmd);
    if (!strcmp(cmd, "insert")) {
      scanf("%d", &x);
      insert(x);
    } else if (!strcmp(cmd, "delete")) {
      scanf("%d", &x);
      delete(x);
    } else if (!strcmp(cmd, "deleteFirst")) deleteFirst();
    else if (!strcmp(cmd, "deleteLast")) deleteLast();
  }

  for (p = list.fp; p != &list; p = p->fp) {
    if (p->fp != &list) printf("%d ", p->key);
    else printf("%d\n", p->key);
  }

  return 0;
}

void insert(int x)
{
  struct element *p;

  p = (struct element *)malloc(sizeof(struct element));

  p->key = x;

  p->fp = list.fp;
  p->bp = &list;
  p->fp->bp = p;
  list.fp = p;
}

void delete(int x)
{
  struct element *p;
  int found = 0;

  for (p = list.fp; p != &list; p = p->fp) {
    if (p->key == x) {
      found = 1;
      break;
    }
  }

  if (found == 1) {
    p->bp->fp = p->fp;
    p->fp->bp = p->bp;
    p->fp = NULL;
    p->bp = NULL;

    free(p);
  }
}

void deleteFirst()
{
  struct element *p = list.fp;

  list.fp = p->fp;
  p->fp->bp = &list;
  p->fp = NULL;
  p->bp = NULL;

  free(p);
}

void deleteLast()
{
  struct element *p = list.bp;

  p->bp->fp = &list;
  list.bp = p->bp;
  p->fp = NULL;
  p->bp = NULL;

  free(p);
}