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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    auto solve = [&]() {
        string s;
        cin >> s;

        int n = s.size();

        string suit = "cdhs";

        int ans = n;

        do {
            vector<int> a(n);
            for (int i = 0; i < n; i++) {
                a[i] = suit.find(s[i]);
            }

            // for (int i = 0; i < n; i++) {
            //     cout << a[i] << " \n"[i == n - 1];
            // }

            vector dp(n + 1, vector<int>(4));

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < 4; j++) {
                    dp[i + 1][j] = max(dp[i + 1][j], dp[i][j] + (a[i] == j));
                    if (j < 3) {
                        dp[i + 1][j + 1] = dp[i + 1][j];
                    }
                }
            }

            // cout << dp[n][3] << '\n';

            ans = min(ans, n - dp[n][3]);
        } while (next_permutation(suit.begin(), suit.end()));

        cout << ans << '\n';
    };
    
    solve();
    
    return 0;
}