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;

public class Main {
	DoublyLinkedList first;
	public static void main(String args[]) {
		new Main().run();
	}
	public void run() {
		InputStreamReader isr = new InputStreamReader(System.in);
		BufferedReader br = new BufferedReader(isr);
		first = new DoublyLinkedList(-1);
		try {
			int n = Integer.parseInt(br.readLine());
			for (int i = 0; i < n; i++) {
				String line = br.readLine();
				int num;
				if (line.charAt(0) == 'i') {
					num = Integer.parseInt(line.substring(7));
					insertHead(num);
				} else {
					switch(line.charAt(6)) {
					case ' ':
						num = Integer.parseInt(line.substring(7));
						deleteKey(num);
						break;
					case 'F':
						deleteFirst();
						break;
					case 'L':
						deleteLast();
						break;
					}
				}
			}
			printList();
		} catch (Exception e) {
			// TODO 自動生成された catch ブロック
			e.printStackTrace();
			System.out.println(e);
		}
	}

	public void insertHead(int n) {
		if (first.num >= 0){
			DoublyLinkedList dll = new DoublyLinkedList(n);
			dll.setNext(first);
			first.setBack(dll);
			first = dll;
		} else {
			first = new DoublyLinkedList(n);
		}
	}
	public void deleteKey(int n) {
		DoublyLinkedList dll = first;
		if (first.num == n) {
			deleteFirst();
			return;
		}
		while(dll != null) {
			if (dll.num == n) {
				if (dll.next != null) {
					dll.next.setBack(dll.back);
				}
				dll.back.setNext(dll.next);
				return;
			}
			dll = dll.next;
		}
	}
	public void deleteFirst() {
		if (first.next != null) {
			first = first.next;
		} else {
			first = new DoublyLinkedList(-1);
		}
	}
	public void deleteLast() {
		DoublyLinkedList dll = first;
		while (dll.next != null)
			dll = dll.next;
		if (dll != first) {
			dll.back.setNext(null);
		} else {
			first = new DoublyLinkedList(-1);
		}
	}
	public void printList() {
		DoublyLinkedList dll = first;
		boolean flag = true;
		while (dll != null) {
			System.out.print((flag?"":" ") + dll.num);
			dll = dll.next;
			flag = false;
		}
		System.out.println();
	}
}

class DoublyLinkedList {
	int num;
	DoublyLinkedList next,back;
	DoublyLinkedList(int n) {
		num = n;
	}
	public void setNext(DoublyLinkedList dll) {
		next = dll;
	}
	public void setBack(DoublyLinkedList dll) {
		back = dll;
	}
}