#include<stdlib.h>
#include<stdio.h>
#include<string.h>

typedef struct Node
{
    int key;
    struct Node *prev, *next;
} Node;

struct Node *nil;

void initlist()
{
    nil = (Node *)malloc(sizeof(Node));
    nil->next = nil;
    nil->prev = nil;
}

void insertNode(int key)
{
    Node *x = (Node *)malloc(sizeof(Node));
    x->key = key;
    x->next = nil->next;
    nil->next->prev = x;
    nil->next = x;
    x->prev = nil;
}

Node* listSearch(int key)
{
    Node *cur = nil->next;
    while (cur != nil && cur->key != key)
    {
        cur = cur->next;
    }
    return cur;
}
void deleteNode(Node *t)
{
    if (t == nil)
    {
        return;
    }
    t->prev->next = t->next;
    t->next->prev = t->prev;
    free(t);
}

void deleteFirst()
{
    deleteNode(nil->next);
}

void deleteLast()
{
    deleteNode(nil->prev);
}

void deleteKey(int key)
{
    deleteNode(listSearch(key));
}

void printList()
{
    Node *cur = nil->next;
    int isf = 0;
    while (1)
    {
        if (cur == nil)
        {
            break;
        } else if(isf++ > 0)
        {
            printf(" ");
        }
        printf("%d", cur->key);
        cur = cur->next;
    }
    printf("\n");
}

int main()
{
    int key, n;
    char comm[15];

    scanf("%d", &n);

    initlist();
    for (int i = 0; i < n; i++)
    {
        scanf("%s%d", comm, &key);
        if (comm[0] == 'i')
        {
            insertNode(key);
        } else if (comm[0] == 'd')
        {
            if (strlen(comm) > 6)
            {
                if (comm[6] == 'F')
                {
                    deleteFirst();
                } else if (comm[6] == 'L')
                {
                    deleteLast();
                }
            } else
            {
                deleteKey(key);
            }
            
        }
        
    }
    
    printList();
    return 0;
}
