#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

void solve() {
	string s;
	cin >> s;
	int n = s.size();
	auto check = [&](string t) {
		if (t[0] == t[1] || t[1] == t[2]) {
			t.erase(unique(all(t)), t.end());
			if (t.size() == 2) return 1;
		}
		return 0;
	};
	int ans = 0;
	rep(i, 0, n - 2) {
		ans += check(s.substr(i, 3));
	}
	cout << ans << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}