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 CPP):

Solution:
#include <bits/stdc++.h>
long long gi() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) f ^= ch == '-', ch = getchar();
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return f ? x : -x;
}
char _[1000010];
bool s[1000010];
int n;
int yes[2000010];
int A[1000010];
bool check0() {
  int now = 1000005;
  yes[now] = 1;
  for (int i = 1; i <= n; ++i) {
    if (s[i])
      ++now;
    else
      --now;
    A[i] = now - 1000005;
    ++yes[now];
  }
  return yes[now] == 1;
}
struct fuck {
  int mn, _mn, mx, _mx;
} seg[4000010];
int tag[4000010];
fuck operator+(const fuck& a, const fuck& b) {
  fuck c;
  if (a.mn <= b.mn)
    c.mn = a.mn, c._mn = a._mn;
  else
    c.mn = b.mn, c._mn = b._mn;
  if (a.mx >= b.mx)
    c.mx = a.mx, c._mx = a._mx;
  else
    c.mx = b.mx, c._mx = b._mx;
  return c;
}
void Upd(int x, int d) {
  seg[x].mn += d;
  seg[x].mx += d;
  tag[x] += d;
}
void down(int x) {
  if (tag[x]) Upd(x << 1, tag[x]), Upd(x << 1 | 1, tag[x]), tag[x] = 0;
}
void build(int x, int l, int r) {
  if (l == r) {
    seg[x] = {A[l], l, A[l], l};
    return;
  }
  build(x << 1, l, ((l + r) >> 1)), build(x << 1 | 1, ((l + r) >> 1) + 1, r);
  seg[x] = seg[x << 1] + seg[x << 1 | 1];
}
void update(int x, int l, int r, int L) {
  if (L <= l) return Upd(x, 1);
  down(x);
  if (L <= ((l + r) >> 1)) update(x << 1, l, ((l + r) >> 1), L);
  update(x << 1 | 1, ((l + r) >> 1) + 1, r, L);
  seg[x] = seg[x << 1] + seg[x << 1 | 1];
}
int query(int x, int l, int r, int p) {
  if (l == r) return seg[x].mn;
  down(x);
  if (p <= ((l + r) >> 1))
    return query(x << 1, l, ((l + r) >> 1), p);
  else
    return query(x << 1 | 1, ((l + r) >> 1) + 1, r, p);
}
int main() {
  scanf("%s", _ + 1);
  n = strlen(_ + 1);
  for (int i = 1; i <= n; ++i) s[i] = _[i] == _[n];
  if (check0()) return puts("1"), 0;
  build(1, 1, n);
  int ans = 0;
  for (int i = -n; i; ++i) {
    if (seg[1].mn == i) update(1, 1, n, seg[1]._mn);
    if (seg[1]._mx == n && seg[1].mx > 0) ++ans;
  }
  printf("%d\n", ans);
  return 0;
}