import java.util.Scanner;
import java.util.Stack;

public class C {
    private static Tree tree = new Tree();

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNextLine()) {
            solve(in.nextLine());
        }
    }

    private static void solve(String line) {
        Stack<Node> stack = new Stack<>();
        stack.add(tree.node1);
        Node cur = tree.node1;
        for (int i = 0; i < line.length(); i++) {
            switch (line.charAt(i)) {
                case 'L':
                    cur = cur.left;
                    stack.push(cur);
                    break;
                case 'R':
                    cur = cur.right;
                    stack.push(cur);
                    break;
                case 'B':
                    if (stack.size() > 1) {
                        stack.pop();
                        cur = stack.peek();
                    }
                    break;
            }
        }
        System.out.println(cur.v);
    }

    static class Node {
        public int v;
        public Node left;
        public Node right;
    }

    static class Tree {
        public Node node1;
        public Node node2;
        public Node node3;
        public Node node4;
        public Node node5;

        public Tree() {
            node1 = new Node();
            node2 = new Node();
            node3 = new Node();
            node4 = new Node();
            node5 = new Node();

            node1.v = 1;
            node1.left = node2;
            node1.right = node3;

            node2.v = 2;
            node2.left = node3;
            node2.right = node4;

            node3.v = 3;
            node3.left = node4;
            node3.right = node5;

            node4.v = 4;
            node4.left = node5;
            node4.right = node1;

            node5.v = 5;
            node5.left = node1;
            node5.right = node2;

        }
    }
}