#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int e[N], l[N], r[N], idx;
int m;

void init()
{
    r[0] = 1, l[1] = 0;
    idx = 2;
}

void l_insert(int x)
{
    e[idx] = x; 
    l[idx] = 0; //左是头
    r[idx] = r[0]; //右是头右边
    r[0] = idx;
    l[r[idx]] = idx;
    idx ++;
}

void r_insert(int x)
{
    e[idx] = x;
    r[idx] = 1;
    l[idx] = l[1];
    l[1] = idx;
    r[l[idx]] = idx;
    idx ++;
}

void remove (int k)
{
    r[l[k]] = r[k];
    l[r[k]] = l[k];
}

void k_left_insert(int k, int x)
{
    e[idx] = x;
    l[idx] = l[k];
    r[idx] = k;
    r[l[k]] = idx;
    l[k] = idx++;
}

void k_right_insert(int k, int x)
{
    e[idx] = x;
    l[idx] = k;
    r[idx] = r[k];
    l[r[k]] = idx;
    r[k] = idx++;

}


int main()
{

    init();
    cin >> m;
    int k, x;
    string opr;
    while(m --)
    {
        cin >> opr;
        if(opr == "L")
        {
            cin >> x;
            l_insert(x);
        }
        else if(opr == "R")
        {
            cin >> x;
            r_insert(x);
        }
        else if(opr == "IL")
        {
            cin >> k >> x;
            k_left_insert(k + 1, x);
        }
        else if(opr == "IR")
        {
            cin >> k >> x;
            k_right_insert(k + 1, x);
        }
        else
        {
            cin >> k;
            remove(k + 1);
        }
    }

    for(int i = r[0]; i != 1; i = r[i])
    {
        cout << e[i] << ' ';
    }
    cout << endl;

    return 0;
}