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: Accepted)

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

struct node{
  unsigned int key;
  struct node *next;
  struct node *pre;
};

typedef struct node * NodePointer;

NodePointer nil;

NodePointer listSearch(int key){
  NodePointer S = nil->next;
  while( S != nil && S->key != key ){
    S = S->next;
  }
  return S;
}

void init(){
  nil = malloc(sizeof(struct node));
  nil -> next = nil;
  nil -> pre = nil;
}

void printList(){
  NodePointer S = nil->next;
  int s = 1;
  while(1){
    if ( S == nil ) break;
    if ( s == 0)  printf(" ");
    printf("%d", S -> key);

    S = S -> next;
    s = 0;
  }
  printf("\n");
}

void deleteNode(NodePointer t){
  t -> pre ->next = t->next;
  t -> next ->pre = t->pre;
  
}

void deleteFirst(){
  NodePointer t = nil->next;
  if ( t == nil ) return;
  deleteNode(t);
}

void deleteLast(){
  NodePointer t = nil -> pre;
  if ( t == nil ) return;
  deleteNode(t);
}

void delete(int key){
  NodePointer t = listSearch(key);
  if ( t == nil ) return;
  deleteNode(t);
}


void insert(int key){
  NodePointer a;
  a = malloc(sizeof(struct node));
  a -> key = key;
  a -> next = nil->next;
  nil -> next->pre = a;
  nil -> next = a;
  a -> pre = nil;
}

int main(){
  int key, n, i;
  int size = 0;
  char S[20];
  int p = 0, d = 0;
  scanf("%d", &n);
  init();
  for ( i = 0; i < n; i++ ){
    scanf("%s%d", S, &key);
    if(!( 0 <= key && key <= 2000000000)){printf("error") ;}
    if ( S[0] == 'i' ) {insert(key); p++; size++;}
    else if ( S[0] == 'd' ) {
      if (strlen(S) > 6){
	if ( S[6] == 'F' ) deleteFirst();
	else if ( S[6] == 'L' ) deleteLast();
      } else {
	delete(key); d++; 
      }
      size--;
    }
    if ( size > 1000000000 ) { printf("error"); }
  }

  
  if(!( p+d <= 2000000)){printf("error") ;}
  if(!( d <= 20)){printf("error") ;}
  printList();


  return 0;
}