Problem:
Doubly Linked List

Your task is to implement a double linked list.

Write a program which performs the following operations:

insert x: insert an element with key x into the front of the list.

delete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.

deleteFirst: delete the first element from the list.

deleteLast: delete the last element from the list.

Input

The input is given in the following format:

n

command1

command2

...

commandn

In the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:

insert x

delete x

deleteFirst

deleteLast

Output

Print all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.

Constraints

The number of operations ≤ 2,000,000

The number of delete operations ≤ 20

0 ≤ value of a key ≤ 109

The number of elements in the list does not exceed 106

For a delete, deleteFirst or deleteLast operation, there is at least one element in the list.

Sample Input 1

7
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5

Sample Output 1

6 1 2

Sample Input 2

9
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5
deleteFirst
deleteLast

Sample Output 2

1

Solution in C (judge verdict: Time Limit Exceeded)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
struct Node {
  int val;
  struct Node *prev;
  struct Node *next;
};
 
struct Node *root = NULL;
 
void insert(struct Node **head, int val) {
  struct Node *new = malloc(sizeof(struct Node));
 
  new->val = val;
  new->next = *head;
  new->prev = NULL;
 
  if (*head != NULL)
    (*head)->prev = new;
  else
    root = new;
 
  *head = new;
}
 
void delete(struct Node **head, struct Node *node) {
  if (*head == NULL || node == NULL)
    return;
 
  if (*head == node)
    *head = node->next;
 
  if (node->next != NULL)
    node->next->prev = node->prev;
 
  if (node->prev != NULL)
    node->prev->next = node->next;
 
  free(node);
 
  return;
}
 
struct Node *find(struct Node **head, int val) {
  if (*head == NULL)
    return NULL;
 
  struct Node *cur = *head;
 
  while (cur != NULL) {
    if (cur->val == val)
      return cur;
    cur = cur->next;
  }
 
  return NULL;
}
 
void deleteFirst(struct Node **head) {
  if (*head == NULL)
    return;
 
  delete(head, find(head, (*head)->val));
}
 
void deleteLast(struct Node **head) {
  if (*head == NULL)
    return;
 
  struct Node *temp = *head;
 
  while (temp->next != NULL) {
    temp = temp->next;
  }
 
  if (temp->prev != NULL) {
    temp->prev->next = NULL;
  } else {
    root = NULL;
  }
 
  free(temp);
}
 
void printList() {
  if (root == NULL)
    return;
 
  struct Node *cur = root;
 
  // print everything in list
  while (cur->next != NULL) {
    printf("%d ", cur->val);
    cur = cur->next;
  }
 
  if (cur != NULL)
    printf("%d\n", cur->val);
}
 
 
int main() {
  int n, i, element;
  char command[15];
 
  scanf("%d", &n);
 
  for (i = 0; i < n; i++) {
    scanf("%s", &command);
 
    if (!strcmp(command, "insert")) {
      scanf("%d", &element);
      insert(&root, element);
    } else if (!strcmp(command, "deleteFirst")) {
      deleteFirst(&root);
    } else if (!strcmp(command, "deleteLast")) {
      deleteLast(&root);
    } else if (!strcmp(command, "delete")) {
      scanf("%d", &element);
      delete(&root, find(&root, element));
    }
    //printList();
  }
 
  printList();
}