#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int, int> II;

const int N = (int) 1e5 + 10;
int n, L[N], R[N];
char S[N];

int main() {
    #ifdef LOCAL
        freopen("Data.inp", "r", stdin);
        freopen("Data.out", "w", stdout);
    #endif

    scanf("%s", S + 1);
    n = strlen(S + 1);

    int ans;
    if (S[n] == 'E') ans = n; else
    if (S[1] == 'E') ans = 1; else {
        int len = 0;
        for (int i = 1; i <= n; ++i) if (S[i] == 'E') {
            int j = i; while (j < n && S[j + 1] == 'E') j++;
            len = max(len, j - i + 1);
            if (len == 1) ans = i; else
            if (len <= 3) ans = i + (len + 1) / 2;
            else ans = i + (len + 1) / 2 - 1;
            i = j;
        }
    }

    printf("%d", ans - 1);
    return 0;
}