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>
#define MAX 100000

typedef struct List{
  int key;
  struct List *next;
  struct List *prev;
}LIST;

LIST *list;

LIST* search(int key){
  LIST *x = list->next;
  while(x != NULL && x->key != key)
    x = x->next;
  return x;
}

void init(){
  list = (LIST *)malloc(sizeof(LIST));
  list->next = list;
  list->prev = list;
}

void print(){
  LIST *x = list->next;
  int i = 0;
  while(1){
    if(x == list) break;
    printf("%d ", x->key);
    x = x->next;
  }
  printf("\n");
}

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

void deletenode(LIST *x){
  if(x == list) return;
  x->prev->next = list->next;
  x->next->prev = list->prev;
  free(x);
}

void deletekey(int key){
  deletenode(search(key));
}

void deleteFirst(){
  deletenode(list->next);
}

void deleteLast(){
  deletenode(list->prev);
}

int main()
{
  int key, n, i, size = 0, np = 0, nd = 0;
  char com[20];
  scanf("%d", &n);
  init();
  for(i = 0; i < n; i++){
    scanf("%s %d", com, &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--;
    }
  }

  print();
  return 0;
}