#include <iostream>

#include <cstdio>

#include <algorithm>

using namespace std;



struct node

{

       char value;

       node *next;

       node *prev;

};



node *nil,*current;



int main()

{

    nil=new node;

    current=nil;

    nil->next=nil->prev=nil;

    char c;

    while((c=getchar())!='\n')

    {

         switch(c)

         {

                  case 'L':

                       if(current!=nil)

                           current=current->prev;

                       break;

                  case 'R':

                       if(current->next!=nil)

                           current=current->next;

                       break;

                  default:

                          node *add = new node;

                          add->value=c;

                          add->prev=current;

                          add->next=current->next;

                          current->next->prev=add;

                          current->next=add;

                          current=add;

         };

    }

    node *prn=nil->next;

    while(prn!=nil)

    {

                   cout<<prn->value;

                   prn=prn->next;

    }

    return 0;

}