import java.util.*;

public class ListDemo 
{
    public static void main (String[] args)
    {
        int array[] = {14, 56, 12, 32, 37, 75, 12, 79};

        LinkedList list = new LinkedList();

        // construct list
        System.out.println("constructing list:");
        for (int i = 0; i < array.length; i++) {
            if (i < array.length/2) {
                list.addFirst(new Integer(array[i]));
            } else {
                list.addLast(new Integer(array[i]));
            }
        }
        System.out.println("list = " + list + " (" + list.size() + ")");

        // remove first item
        System.out.println("removing first item:");
        list.removeFirst();
        System.out.println("list = " + list + " (" + list.size() + ")");

        // remove last item
        System.out.println("removing last item:");
        list.removeLast();
        System.out.println("list = " + list + " (" + list.size() + ")");

        // reverse the list
        System.out.println("reversing list:");
        list.reverse();
        System.out.println("list = " + list + " (" + list.size() + ")");

        // remove the odd numbers
        System.out.println("removing the odd numbers:");
        Iterator i = list.iterator();
        while (i.hasNext()) {
            int n = ((Integer) i.next()).intValue();
            if (n % 2 == 1) {
                i.remove();
            }
        }
        System.out.println("list = " + list + " (" + list.size() + ")");

        // remove first item
        System.out.println("removing first item:");
        list.removeFirst();
        System.out.println("list = " + list + " (" + list.size() + ")");

        // empty the list from the back
        System.out.println("removing all items from the back:");
        while (!list.isEmpty()) {
            list.removeLast();
        }
        System.out.println("list = " + list + " (" + list.size() + ")");

    }
}