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<string.h>
#include <math.h>
#include <stdlib.h>

#define MAX 10000
#define N 101


struct node{
  int key;
  struct node *next;
  struct node *prev;
} ;
typedef struct node *NodePointer;

void Insert(int);
void Deletekey(int);
NodePointer Search(int);
void Delete(NodePointer);

NodePointer nil;

int main()
{
  int i, n, keydata;
  char c[12];
  NodePointer x;


  nil = (NodePointer)malloc(sizeof(struct node));
  nil->next = nil;
  nil->prev = nil;
  nil->key = -1;

  scanf("%d",&n);

  for(i = 0; i < n; i++) {
    scanf("%s",c);

    if(strcmp(c,"insert") == 0) {
      scanf("%d",&keydata);
      Insert(keydata);
    }
    else if(strcmp(c,"delete") == 0) {
      scanf("%d",&keydata);
      Deletekey(keydata);
    }
    else if(strcmp(c,"deleteFirst") == 0){
      Delete(nil->next);
    }
    else {
      Delete(nil->prev);
    }
  }

  x = nil->next;
  printf("%d",x->key);
  x = x->next;
  while(x != nil) {
    printf(" %d",x->key);
    x = x->next;
  }
  printf("\n");


  x = nil->next->next;
  while(x != nil) {
    free(x->prev);
    x = x->next;
  }
  free(nil);

  return 0;
}

void Insert(int keydata)
{
  NodePointer x;

  x = (NodePointer)malloc(sizeof(struct node));

  x->key = keydata;
  
  x->next = nil->next;
  nil->next->prev = x;
  nil->next = x;
  x->prev = nil;
}

void Deletekey(int keydata)
{
  NodePointer x;

  if((x = Search(keydata)) == nil) return;

  Delete(x);
}

NodePointer Search(int keydata)
{
  NodePointer x;

  x = nil->next;
  while(x != nil && x->key != keydata) {
    x = x->next;
  }
  
  return x;
}

void Delete(NodePointer x)
{
  x->prev->next = x->next;
  x->next->prev = x->prev;
  free(x);
}