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

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

struct Node *nil;

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

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

void printlist(void)
{
    struct 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 delete(struct Node *t)
{
    if(t==nil) return;
    t->prev->next=t->next;
    t->next->prev=t->prev;
    free(t);
}

void deletefirst(void)
{
    delete(nil->next);
}

void deletelast(void)
{
    delete(nil->prev);
}

void deletekey(int key)
{
    //検索したノードの削除
    delete(listseach(key));
}

void insert(int key)
{
    struct Node *x=(struct Node*)malloc (sizeof(struct Node));
    x->key=key;

    x->next=nil->next;
    nil->next->prev=x;
    nil->next=x;
    x->prev=nil;
}

int main(){
    int key,n,i,size=0;
    char str[20];
    int np=0,nd=0;

    scanf("%d",&n);
    init();
    for(i=0;i<n;i++){
    scanf("%s%d",str,&key);
    if(str[0]=='i'){
        insert(key);
        np++;
        size++;
    }
    else if(str[0]=='d'){
        if(strlen(str)>6){
            if(str[6]=='F') deletefirst();
            if(str[6]=='L') deletelast();
        }else{
            deletekey(key);
            nd++;
        }
        size--;
        }
    }
    printlist();
    return 0;
}
