#include <iostream>
#include <algorithm>
#include <climits>
#include <cmath>
#include <numeric>
#include <string>
#include <sstream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <deque>
// #include <priority_queue>
#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
int main() { FASTIO;
string thing;
cin >> thing;
int len = thing.length();
int intsFound = 0;
bool lastFoundWasInt = false;
for (int i = 0; i < len; i++) {
if (thing[i] - 'a' >= 0 && thing[i] - 'a' < 26) {
lastFoundWasInt = false;
} else if (lastFoundWasInt == false) {
intsFound++;
lastFoundWasInt = true;
}
}
cout << intsFound;
return 0;
}
