#include<bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);

    string s;
    cin >> s;

    vector<char> p = {'h', 'd', 'c', 's'};

    sort(p.begin(), p.end());

    int n = s.size();
    int ans = 1e9;
    do {
        vector<vector<int>> dp(n + 1, vector<int>(5, 1e9));
        dp[0][0] = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 4; j++) {

                if (s[i] == p[j]) {
                    dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
                }
                if (j + 1 < 4 && s[i] == p[j + 1]) {
                    dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j]);
                }
                dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1);
            }
        }
        ans = min(ans, (*min_element(dp[n].begin(), dp[n].end())) );
    } while (next_permutation(p.begin(), p.end()));

    cout << ans ;
}