#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <cstring>
#include <set>
#include <algorithm>
#include <bitset>
#include <time.h>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <cmath>
#include <unordered_map>

#define nl '\n'
#define sp ' '
#define pb(x) push_back(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define forn2(n) for(int i=0;i<n;++i) for(int j=0;j<n;++j)
#define forn1(n, m) for(int i=0;i<n;++i) for(int j=0;j<m;++j)
#define forn(j, n) for(int i=j;i<n;++i)
#define ull unsigned long long
#define ll long long
#define SIZE (1<<9)
using namespace std;

template<class a>
void print(a v) {
    //for_each(all(v), [](auto x) { cout << x; });
}
int main() {
    ios_base::sync_with_stdio(false);
    freopen("text.in","r",stdin);
    freopen("text.out","w",stdout);
    clock_t tStart = clock();
    int nrCuv=0,nrLitere=0;
    char*ch = new char;
    int i = 0;
    while(cin.get(ch[i])){
        if(isalpha(ch[i])) {
            ++nrLitere;
            if (!isalpha(ch[i - 1 + !i]))
                ++nrCuv;
            if(i==0) ++nrCuv;
        }
        i++;
    }
    cout << nrLitere/nrCuv << nl;
    //printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}