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

typedef struct node{
    struct node *prev;
    struct node *next;
    long int key;
}Node;

Node *First;

void init(){
    First = (Node *)malloc(sizeof(Node));
    First->prev = First;
    First->next = First;
    First->key = -1;
}


void Insert(long int x){
    Node *NewNode;
    NewNode = (Node *)malloc(sizeof(Node));
    NewNode->key = x;
    NewNode->next = First->next;
    NewNode->prev = First;
    NewNode->next->prev = NewNode;
    NewNode->prev->next = NewNode;
}

void DeleteFirst(void){
    Node *deleteP;
    deleteP = First->next;
    deleteP->next->prev = deleteP->prev;
    First->next = deleteP->next;
    free(deleteP);
}

void DeleteLast(void){
    Node *deleteP;
    deleteP = First->prev;
    deleteP->prev->next = deleteP->next;
    First->prev = deleteP->prev;
    free(deleteP);
}

void Delete(long int x){
    Node *cur;
    cur = First->next;
    for (;;){
        if (cur->key == x){
            cur->prev->next = cur->next;
            cur->next->prev = cur->prev;
            free(cur);
            break;
        }
        cur = cur->next;
    }
}


int main(void){
    int n;
    char command[20];
    long int x;
    int i;
    Node *printNode;

    init();
    
    scanf("%d", &n);
    for (i = 0; i < n; i++){
        scanf(" %s %ld", command, &x);
        
        if (strcmp(command, "insert") == 0){
            Insert(x);
        }
        if (strcmp(command, "delete") == 0){
            Delete(x);
        }
        if (strcmp(command, "deleteFirst") == 0){
            DeleteFirst();
        }
        if (strcmp(command, "deleteLast") == 0){
            DeleteLast();
        }
    }
    printNode = First->next;

    while (printNode->next->key != -1){
        printf("%ld ", printNode->key);
        printNode = printNode->next;
    }

    printf("%ld\n", printNode->key);

    return 0;
}