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>
typedef struct node{
  int key;
  struct node *next, *prev;
} node;
node* Insert(int);
node* Finditem(int);
node* Make_1node(int);
void Delete(int);
void DeleteF(void);
void DeleteL(void);
void Print(void);
node *head;
int main(){
  int i, n, key;
  char func[11];
  scanf("%d",&n);
  head = (node*)malloc(sizeof(node));
  head->next = head->prev = NULL;
  for(i=0; i<n; i++){
    scanf("%s",func);
    if(strcmp(func,"insert") == 0){
      scanf("%d",&key);
      Insert(key);
    }
    else if(strcmp(func,"delete") == 0){
      scanf("%d",&key);
      Delete(key);
    }
    else if(strcmp(func,"deleteFirst") == 0) DeleteF();
    else if(strcmp(func,"deleteLast") == 0) DeleteL();
  }
  Print();
  return 0;
}
node* Insert(int key){
  node *n;
  n = Make_1node(key);
  n->next = head->next;
  n->prev = head;
  head->next = n;
  if(n->next != NULL) n->next->prev = n;
  return n;
}
node* Finditem(int key){
  node *n;
  for (n = head; n->next != NULL; n = n->next) {
    if (n->next->key == key) return n;
  }
  return NULL;
}
node* Make_1node(int key){
  node *n;
  n = (node*)malloc(sizeof(node));
  n->key = key;
  return n;
}
void Delete(int key){
  node *n, *del;
  n=Finditem(key);
  if(n == NULL) return;
  del = n->next;
  if(del->next == NULL){
    n->next = NULL;
    free(del);
    return;
  }
  n->next = del->next;
  n->next->prev = n;
  free(del);
}
void Print(){
  node *n;
  for(n=head->next; n!=NULL; n=n->next){
    printf("%d",n->key);
    printf(n->next != NULL ? " " : "\n");
  }
}
void DeleteF(void){
  node *del;
  del = head->next;
  if(del->next != NULL){
    head->next = head->next->next;
    head->next->prev = head;
  }
  else head->next = NULL;
  free(del);
}
void DeleteL(void){
  node *m, *del;
  for(m=head; m->next->next!=NULL; m=m->next);
  del = m->next;
  m->next = NULL;
  free(del);
}