#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <random>
#include <set>

using namespace std;

const int MAXN = 250;

int dp[MAXN][2];

int main() {
    string s;
    cin >> s;
    dp[0][0] = 0;
    dp[0][1] = 1;
    for (int i = 1; i <= s.size(); ++i) {
        dp[i][0] = min(dp[i - 1][0] + (s[i - 1] != 'R'),
                dp[i - 1][1] + (s[i - 1] != 'L') + 1);
        dp[i][1] = min(dp[i - 1][1] + (s[i - 1] != 'L'),
                dp[i - 1][0] + (s[i - 1] != 'R') + 1);
    }
    cout << dp[s.size()][1];
    return 0;
}