#include<bits/stdc++.h>
#define int long long
using namespace std;
auto IN = freopen("chemistryh.in", "r", stdin);
auto OUT = freopen("chemistryh.out", "w", stdout);
auto mread = [](){int x;scanf("%lld", &x);return x;};
string s;
vector<int> v[305];
int d[305];
void dfs(int x, int fa){
    for(int y : v[x]){
        if(y == fa){
            continue;
        }
        d[y] = d[x] + 1;
        dfs(y, x);
    }
    return;
}
signed main(){
    while(cin >> s){
        int n = s.size();
        for(int i = 1; i <= n; i ++){
            v[i].clear();
        }
        int idx = 1;
        stack<int> st;
        st.push(idx);
        int re[n + 5] = {0};
        re[idx] = 4;
        for(int i = 1; i < n; i ++){
            while(st.size() && re[st.top()] == 0){
                st.pop();
            }
            if(s[i] == 'C'){
                idx ++;
                v[st.top()].push_back(idx);
                v[idx].push_back(st.top());
                re[st.top()] --;
                st.push(idx);
                re[idx] = 3;
            }
            else{
                re[st.top()] --;
            }
        }
        d[1] = 1;
        dfs(1, 0);
        int ma = 0, p = 0;
        for(int i = 1; i <= idx; i ++){
            if(d[i] > ma){
                ma = d[i];
                p = i;
            }
        }
        d[p] = 1;
        dfs(p, 0);
        ma = 0;
        for(int i = 1; i <= idx; i ++){
            ma = max(ma, d[i]);
        }
        printf("%lld\n", ma);
    }
    return 0;
}