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

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

Node *nil;

void init();
Node* search(int);
void deleteNode(Node*);
void insert(int);
void delete(int);
void deleteFirst();
void deleteLast();
void printList();
int main(void){
    int key, n, i;
    char com[20];
    scanf("%d", &n);
    init();
    for(i = 0; i < n; i++){
        scanf("%s%d", com, &key);
        if(com[0] == 'i') insert(key);
        else if(com[0] == 'd'){
            if(strlen(com) > 6){
                if(com[6] == 'F') deleteFirst();
                else if(com[6] == 'L') deleteLast();
            }
            else delete(key);
        }
    }
    printList();

    return 0;
}

Node* search(int key){
    Node *cur = nil->next;
    while(cur != nil && cur->key != key){
        cur = cur->next;
    }
    return cur;
}

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

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

void deleteNode(Node *dst){
    if(dst == nil) return;
    dst->prev->next = dst->next;
    dst->next->prev = dst->prev;
    free(dst);
}

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

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

void delete(int key){
    deleteNode(search(key));
}

void insert(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;
}
