using System;
using System.Text;

namespace ALDS1_3_C {
    public class Node {
        private int _val;
        private Node _prev;
        private Node _next;

        public Node(int val, Node prev, Node next) {
            _val = val;
            _prev = prev;
            _next = next;
        }

        public int Value {
            get { return _val; }
            set { _val = value; }
        }

        public Node Next {
            get { return _next; }
            set { _next = value; }
        }

        public Node Prev {
            get { return _prev; }
            set { _prev = value; }
        }
    }

    public class DoublyLinkedList {
        private Node _dummy;

        public DoublyLinkedList() {
            _dummy = new Node(default(int), null, null);
            _dummy.Next = _dummy;
            _dummy.Prev = _dummy;
        }

        public Node First {
            get { return _dummy.Next; }
        }

        public Node Last {
            get { return _dummy.Prev; }
        }

        public Node End {
            get { return _dummy; }
        }

        public void AddAfter(Node n, int val) {
            Node ret = new Node(val, n, n.Next);
            n.Next.Prev = ret;
            n.Next = ret;
        }

        public void AddBefore(Node n, int val) {
            Node ret = new Node(val, n.Prev, n);
            n.Prev.Next = ret;
            n.Prev = ret;
        }

        public void Remove(int val) {
            Node n = ListSearch(val);
            Remove(n);
        }

        private void Remove(Node n) {
            if (n == _dummy)
                return;
            n.Prev.Next = n.Next;
            n.Next.Prev = n.Prev;
        }

        public void AddFirst(int val) {
            AddAfter(_dummy, val);
        }

        public void AddLast(int val) {
            AddBefore(_dummy, val);
        }

        public void RemoveFirst() {
            Remove(First);
        }

        public void RemoveLast() {
            Remove(Last);
        }

        private Node ListSearch(int val) {
            for(Node n = First; n != _dummy; n = n.Next) {
                if (n.Value == val)
                    return n;
            }
            return _dummy;
        }

        public void Print() {
            StringBuilder sb = new StringBuilder();
            for (Node n = First; n != End; n = n.Next) {
                sb.AppendFormat(" {0}", n.Value);
            }
            Console.WriteLine(sb.ToString().TrimStart());
        }
    }

    class Program {
        static void Main(string[] args) {
            int n = int.Parse(Console.ReadLine());
            DoublyLinkedList dll = new DoublyLinkedList();
            for (int i = 0; i < n; i++) {
                string[] input = Console.ReadLine().Split(' ');
                switch (input[0]) {
                    case "insert":
                        dll.AddFirst(int.Parse(input[1]));
                        break;
                    case "delete":
                        dll.Remove(int.Parse(input[1]));
                        break;
                    case "deleteFirst":
                        dll.RemoveFirst();
                        break;
                    case "deleteLast":
                        dll.RemoveLast();
                        break;
                }
            }
            dll.Print();
        }
    }
}

Measured memory_bytes: 69520