#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<bitset>
#include<vector>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<iomanip>
#include <functional>
using namespace std;
typedef long long ll;
//--------------------------


int main()
{
	string s;
	cin >> s;
	int max = 0;
	int ans = 0;
	while (s.find("…") != s.npos) {
		int index = s.find("…");
		if (index == 0 || (s[index - 2] != -127 || s[index - 1] != 99)) {
			if (ans > max) max = ans;
			ans = 0;
		}
		s = s.substr(s.find("…") + 2);
		ans++;
	}

	string ss = "…";
	cout << max << endl;

	return 0;
}