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: Time Limit Exceeded)

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        NodeList node = new NodeList();
        long n = scan.nextLong();

        for(long i=0; i<n; i++) {
            String query = scan.next();
            if(query.equals("insert")) {
                long x = scan.nextLong();
                node.Insert(x);
            }else if(query.equals("delete")) {
                long x = scan.nextLong();
                node.SearchDelete(x);
            }else if(query.equals("deleteFirst")) {
                node.DeleteFirst();
            }else if(query.equals("deleteLast")) {
                node.DeleteLast();
            }
        }
        node.Print();
    }
}

class NodeList{
    NodeList.Node head;

    class Node{
        long key ;
        NodeList.Node right;
        NodeList.Node left;

        Node(long key){
            this.key = key;
        }

        Node(){
            this.key = -1;
        }

        public String toString(){
            return Long.toString(this.key);
        }

        public void printDetail(){
            System.out.println(this.left.key + ' ' + this.key +' ' + this.right.key);
        }
    }

    NodeList(){
        this.head = new NodeList.Node();
        this.head.right = this.head;
        this.head.left = this.head;
    }

    public void Insert(long x){
        NodeList.Node newNode = new NodeList.Node(x);
        newNode.right = this.head.right;
        newNode.right.left = newNode;
        this.head.right = newNode;
        newNode.left = this.head;
    }

    public void Print(){
        NodeList.Node point = this.head.right;
        NodeList.Node start = this.head.right;
        boolean flag = false;
        while(point != this.head) {
            System.out.print(point.toString());
            point = point.right;
            if (flag && point == start) {
                break;
            }
            if (point != this.head) {
                System.out.print(' ');
            }
            flag = true;
        }
        System.out.println("");
    }

    public void PrintAll() {
        System.out.println(this.head);
        NodeList.Node point = this.head.right;
        while(point != this.head) {
            point.printDetail();
            point = point.right;
        }
        System.out.println('\n');
    }

    public void Delete(NodeList.Node point){
        point.right.left = point.left;
        point.left.right = point.right;
    }

    public void SearchDelete(long x){
        NodeList.Node point = this.head.right;
        while(point != this.head) {
            if(point.key == x) break;
            point = point.right;
        }
        this.Delete(point);
    }

    public void DeleteFirst(){
        this.Delete(this.head.right);
    }

    public void DeleteLast(){
        this.Delete(this.head.left);
    }

}