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

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

Node *nil;

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

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

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->next->prev = t->prev;
    t->prev->next = t->next;
    free(t);
}

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

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

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

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

int main(){
    int n, i, key;
    char com[100];
    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 deleteLast();
            } else{
                deleteKey(key);
            }
            
        }
    }
    
    printList();
    
    return 0;
}
