#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int prefix[N];
int main()
{
string s;cin >> s;
for(int i = 1; i <= s.length(); i++)
prefix[i] = prefix[i-1] + (s[i-1] == 'L' ? 1 : -1);
int ans = 0;
for (int i = 1; i <= s.length(); i++)
{
for (int j = i; j <= s.length(); j++)
{
if(prefix[j] - prefix[i-1] == 0) ans = max(ans,j-i+1);
}
}
cout << ans << '\n';
return 0;
}