#include <bits/stdc++.h>
using namespace std;
int LongestConsecutiveCharacter(const std::string& s) {
// Write your logic here.
// Parameters:
// s (const std::string&): The passcode string consisting of lowercase alphabets
// Returns:
// int: Length of the longest part of the passcode that contains only one unique character
int n = s.length();
if (n==1) return 1;
int maxi = INT_MIN;
for (int i=0;i<n-1;i++) {
int cnt = 1;
while (s[i] == s[i+1]) {
cnt++;
if (cnt > maxi) {
maxi = cnt;
}
i++;
}
}
return maxi;
}
int main() {
std::string s;
std::getline(std::cin, s);
cout << s << "fds";
// Call user logic function and print the output
int result = LongestConsecutiveCharacter(s);
std::cout << result << std::endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IExvbmdlc3RDb25zZWN1dGl2ZUNoYXJhY3Rlcihjb25zdCBzdGQ6OnN0cmluZyYgcykgewogICAgLy8gV3JpdGUgeW91ciBsb2dpYyBoZXJlLgogICAgLy8gUGFyYW1ldGVyczoKICAgIC8vICAgICBzIChjb25zdCBzdGQ6OnN0cmluZyYpOiBUaGUgcGFzc2NvZGUgc3RyaW5nIGNvbnNpc3Rpbmcgb2YgbG93ZXJjYXNlIGFscGhhYmV0cwogICAgLy8gUmV0dXJuczoKICAgIC8vICAgICBpbnQ6IExlbmd0aCBvZiB0aGUgbG9uZ2VzdCBwYXJ0IG9mIHRoZSBwYXNzY29kZSB0aGF0IGNvbnRhaW5zIG9ubHkgb25lIHVuaXF1ZSBjaGFyYWN0ZXIKICAgIGludCBuID0gcy5sZW5ndGgoKTsKICAgIGlmIChuPT0xKSByZXR1cm4gMTsKICAgIGludCBtYXhpID0gSU5UX01JTjsKICAgIGZvciAoaW50IGk9MDtpPG4tMTtpKyspIHsKICAgICAgICBpbnQgY250ID0gMTsKICAgICAgICB3aGlsZSAoc1tpXSA9PSBzW2krMV0pIHsKICAgICAgICAgICAgY250Kys7CiAgICAgICAgICAgIGlmIChjbnQgPiBtYXhpKSB7CiAgICAgICAgICAgICAgICBtYXhpID0gY250OwogICAgICAgICAgICB9CiAgICAgICAgICAgIGkrKzsKICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gbWF4aTsKfQoKaW50IG1haW4oKSB7CiAgICBzdGQ6OnN0cmluZyBzOwogICAgIHN0ZDo6Z2V0bGluZShzdGQ6OmNpbiwgcyk7CiAgICAgY291dCA8PCBzIDw8ICJmZHMiOwogICAgCiAgICAvLyBDYWxsIHVzZXIgbG9naWMgZnVuY3Rpb24gYW5kIHByaW50IHRoZSBvdXRwdXQKICAgIGludCByZXN1bHQgPSBMb25nZXN0Q29uc2VjdXRpdmVDaGFyYWN0ZXIocyk7CiAgICBzdGQ6OmNvdXQgPDwgcmVzdWx0IDw8IHN0ZDo6ZW5kbDsKICAgIAogICAgcmV0dXJuIDA7Cn0K