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 JAVA (judge verdict: Runtime Error)

import java.util.Scanner;

class Cell{
  int key;
  Cell prev, next;
  Cell(int key, Cell prev, Cell next){
    this.key = key;
    this.prev = prev;
    this.next = next;
  }
}

class List{
  Cell head;

  List(){
    head = null;
  }

  void insert(int x){
    head = new Cell(x, null, head);
    if(head.next != null)
      head.next.prev = head;
  }

  void delete(int x){
    Cell cell = head;
    while(cell != null){
      if(cell.key == x){
        if(cell.prev == null)
          deleteFirst();
        else if(cell.next == null)
          deleteLast();
        else{
          cell.prev.next = cell.next;
          cell.next.prev = cell.prev;
        }
        break;
      }
      else
        cell = cell.next;
    }
  }

  void deleteFirst(){
      head = head.next;
      head.prev = null;
  }

  void deleteLast(){
    Cell cell = head;
    while(cell.next != null)
      cell = cell.next;

    if(cell.prev != null)
      cell.prev.next = null;
    else
      head = null;
  }

  void printList(){
    Cell cell = head;
    if(cell != null){
      while(cell.next != null){
        System.out.print(cell.key + " ");
        cell = cell.next;
      }
    System.out.println(cell.key);
    }
  }

}

class Main{
  public static void main(String[] args){
    Scanner stdIn = new Scanner(System.in);
    int n = stdIn.nextInt();
    List list = new List();

    for(int i = 0; i < n; i++){
      String order = stdIn.next();
      int x;
      if(order.charAt(0) == 'i'){
        x = stdIn.nextInt();
        list.insert(x);
      }
      else if(order.length() > 6 && order.charAt(6) == 'F')
        list.deleteFirst();
      else if(order.length() > 6 && order.charAt(6) == 'L')
        list.deleteLast();
      else{
        x = stdIn.nextInt();
        list.delete(x);
      }
    }

    list.printList();

  }
}