#include "stdlib.h"
#include "stdio.h"
#include "string.h"

struct NODE{
    int key;
    struct NODE *prev, *next;
};

struct NODE *head;

void init(){
    head = (struct NODE*)malloc(sizeof(struct NODE));
    head->next = head;
    head->prev = head;
}

void insert(int x){
    struct NODE *temp = (struct NODE*)malloc(sizeof(struct NODE));
    temp->key = x;
    temp->next = head->next;
    head->next->prev = temp;
    head->next = temp;
    temp->prev = head; 
}

struct NODE* listSearch(int x){
    struct NODE *cur = head->next;
    while(cur != head && cur->key != x){
        cur = cur->next;
    }
    return cur;
}

void deleteNode(struct NODE *deleNode){
    if(deleNode == head){
        return;
    }
    deleNode->prev->next = deleNode->next;
    deleNode->next->prev = deleNode->prev;
}

void delete(int x){
    deleteNode(listSearch(x));
}

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

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

int N;
char ins[10];
int opNum;


int main(){
    //freopen("DoublyLinkedList.txt", "r", stdin);
    init();
    scanf("%d", &N);
    for(int i=0; i<N; i++){
        scanf("%s", ins);
        if(strcmp(ins, "insert") == 0)
        {
            scanf("%d", &opNum);
            insert(opNum);
        }
        else if(strcmp(ins, "delete") == 0){
            scanf("%d", &opNum);
            delete(opNum);
        }
        else if(strcmp(ins, "deleteFirst") == 0){
            deleteFirst();
        }
        else{
            deleteLast();
        }
    }
    struct NODE *cur = head->next;
    while(cur != head->prev){
        printf("%d ", cur->key);
        cur = cur->next;
    }
    printf("%d\n", cur->key);
}
