#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;
}

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

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

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

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

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

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

void printList(){
    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");
}

int main(){
    int key, n, i;
    int size = 0;
    char command[20];
    scanf("%d", &n);
    init();
    
    for(i = 0; i<n; i++){
            scanf("%s%d", command, &key);
            if(command[0] == 'i'){insert(key); size++;}
            else if(command[0] == 'd'){
                if(strlen(command) == 6) delete(key);
                else if(command[6] == 'F') deleteFirst();
                else if(command[6] == 'L') deleteLast();
                size--;
            }
    }

    printList();

    return 0;
}

