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

#define endl '\n'
#define int long long
#define ull unsigned long long
typedef long long ll;
#define lowbit(x) ((x) & -(x))

const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;
const int N = 1e5 + 5, M = 1e5 + 10;
typedef pair<int, int> PII;
double T = 1 >> 30;
// double PI = acos(-1);

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

int lcm(int a, int b)
{
    return a / gcd(a, b) * b;
}

void solve()
{
    int i, j;

    string s;
    cin >> s;
    int n = s.size();
    s = '?' + s;

    vector<int> v;

    v.push_back(0);

    for (i = 1; i <= n;i++)
    {
        if(s[i]=='h')
        {
            v.push_back(1);
        }else if(s[i]=='c')
        {
            v.push_back(2);
        }else if(s[i]=='d')
        {
            v.push_back(3);
        }else{
            v.push_back(4);
        }
    }

    vector<int> p;
    for (i = 0; i <= 4;i++)
    {
        p.push_back(i);
    }

    int res = 1e5 + 5;

    do
    {
        vector<vector<int>> f(n + 1, vector<int>(5, INF));
        f[0][0] = 0;
        for (i = 1; i <= n;i++)
        {
            int t = p[v[i]];
            for (j = 0; j <= 4;j++)
            {
                if(j!=t)
                    f[i][j] = f[i - 1][j] + 1;
            }
            for (j = 0; j <= t;j++)
            {
                f[i][t] = min(f[i][t], f[i - 1][j]);
            }
        }

        for (i = 0; i <= 4;i++)
        {
            res = min(res, f[n][i]);
        }

    } while (next_permutation(p.begin(), p.end()));

    cout << res;
}

signed main()
{
    // ios_base::sync_with_stdio(false);
    // cin.tie(nullptr);
    // cout.tie(nullptr);
    int t = 1;

    //  cin >> t;

    while (t--)
    {
        //  Case++;
        solve();
    }

    return 0;
}