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: Wrong Answer)

using System;

namespace DefaultNamespace
{
	/// <summary>
	/// Description of Class1.
	/// </summary>
	public class Class1
	{		
		public static void Main(String[] args)
		{
			var listA=new listArray();
			int n = int.Parse(Console.ReadLine());
			int[] list=new int[n];
			
			for(int i=0;i<n;i++)
			{
				string com=Console.ReadLine();
				string[] command=com.Split();
				switch (command[0])
				{
					case "insert":
						listA.insert(int.Parse(command[1]),list);
						//list[first]=int.Parse(command[1]);//first?????¨????????????first-1????????????????????\??£?????????
			//first++;
						break;
					case"deleteFirst":
						listA.deleteFirst();
						//first--;
						break;
					case"deleteLast":
						listA.deleteLast();
						//last++;				
						break;
					case "delete":
						listA.delete(int.Parse(command[1]),list);
						/*for(int j=first-1;j>=last;j--)
			{
							if(list[j]==command[1])
				{
					list[j]=-1;//?????????????????????-1???????????????
					break;
				}
			}
						*/
						break;				
				}
			}
			for(int k=listA.first-1;k>listA.last;k--)
			{
				if(list[k]!=-1&&listA.first-1!=listA.last)
				{
					Console.Write(list[k]+" ");
				}
				else{break;}
			}
			Console.WriteLine(list[listA.last]);			
		}			
	}


	public class listArray
	{
		public int first=0;
		public int last=0;
		public void insert(int val,int[] l)
		{
			l[first]=val;//first?????¨????????????first-1????????????????????\??£?????????
			first++;
		}
		public void deleteFirst()
		{
			first--;
		}
		public void deleteLast()//last???????????\??£????????????
		{
			last++;
		}
		public void delete(int val,int[] l)
		{
			for(int j=first-1;j>=last;j--)
			{
				if(l[j]==val)
				{
					l[j]=-1;//?????????????????????-1???????????????
					break;
				}
			}
		}
		
	
	}
	
	
}