Problem: Valera has a strip infinite in both directions and consisting of cells. The cells are numbered by integers. The cell number 0 has a robot.

The robot has instructions — the sequence of moves that he must perform. In one move, the robot moves one cell to the left or one cell to the right, according to instructions. Before the robot starts moving, Valera puts obstacles in some cells of the strip, excluding cell number 0. If the robot should go into the cell with an obstacle according the instructions, it will skip this move.

Also Valera indicates the finish cell in which the robot has to be after completing the entire instructions. The finishing cell should be different from the starting one. It is believed that the robot completed the instructions successfully, if during the process of moving he visited the finish cell exactly once — at its last move. Moreover, the latter move cannot be skipped.

Let's assume that k is the minimum number of obstacles that Valera must put to make the robot able to complete the entire sequence of instructions successfully and end up in some finishing cell. You need to calculate in how many ways Valera can choose k obstacles and the finishing cell so that the robot is able to complete the instructions successfully.

Input

The first line contains a sequence of characters without spaces s1s2... sn (1 ≤ n ≤ 106), consisting only of letters "L" and "R". If character si equals "L", then the robot on the i-th move must try to move one cell to the left. If the si-th character equals "R", then the robot on the i-th move must try to move one cell to the right.

Output

Print a single integer — the required number of ways. It's guaranteed that this number fits into 64-bit signed integer type.

Examples

Input

RR


Output

1


Input

RRL


Output

1

Note

In the first sample Valera mustn't add any obstacles and his finishing cell must be cell 2.

In the second sample, Valera must add an obstacle in cell number 1, and his finishing cell must be cell number  - 1. In this case robot skips the first two moves and on the third move he goes straight from the starting cell to the finishing one. But if Valera doesn't add any obstacles, or adds an obstacle to another cell, then the robot visits the finishing cell more than once.

Solution (in JAVA):

Solution:
import java.util.*;
// hard to realize:
// that with the "left most point" caused by a wall at +X, for X from 1 to w/e, will be increasing
public class Maze {
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    String cmds = in.next();
    int[] process = new int[cmds.length()+1];
    int min = 0;
    int max = 0;
    int minCount = 1;
    int maxCount = 1;
    int current = 0;
    for (int i = 0; i < cmds.length(); ++i) {
      char c = cmds.charAt(i);
      // doing this before we update current means they will lag behind by 1.
      // but this means that if the final step is a unique location, we can easily detect it
      min = Math.min(min, current);
      max = Math.max(max, current);
      if (c == 'L')
        --current;
      else
        ++current;
    }
    // note that we'll only ever need 0 walls or 1 wall.
    // this is checking the situation for 0 walls needed.
    if (current < min || current > max) { // last move was a step further than all before it
      System.out.println(1);
      return;
    }
    
    // if the last move is "L", it means we only want to put walls on the right.
    // otherwise, if we did something like RL, if we had put walls on the left, 
    // the final move would end up going backwards to hit a square already visited
    if (cmds.charAt(cmds.length()-1) == 'R') {
      // swap R with L
      char[] part = cmds.toCharArray();
      for (int i = 0; i < part.length; ++i) {
        if (part[i] == 'L')
          part[i] = 'R';
        else
          part[i] = 'L';
      }
      cmds = new String(part);
      int temp = min;
      min = -max;
      max = -temp;
    }
    // we need to find all the places to put the single wall, all at once
    // Note that if location +X worked, then location +(X-1) will also work.
    // similarly, if +X didn't work, then location +(X+1) will also fail.
    int low = 0;
    int high = max+1; // because we need a wall (still potentially impossible), we know that 'high' never works.
    
    while (low < high-1) {
      int guess = (low + high)/2;
      int left = 0;
      current = 0;
      for (int j = 0; j < cmds.length(); ++j) {
        left = Math.min(left, current);
        char c = cmds.charAt(j);
        if (c == 'L')
          --current;
        else
          ++current;
        
        if (current == guess)
          --current;
      }
      if (current < left) { // this is a good location!
        low = guess;
      } else { // this is a bad location
        high = guess;
      }
    }
    System.out.println(low);
  }
}