/*
输入一个字符串仅包含大小写字母和数字
求字符串中包含的最长的非严格递增连续数字序列长度
比如:
12234属于非严格递增数字序列
示例:
输入
abc2234019A334bc
输出
4
说明:
2234为最长的非严格递增连续数字序列,所以长度为4
aaaaaa44ko543j123j7345677781
aaaaa34567778a44ko543j123j71
345678a44ko543j123j7134567778aa
*/
using namespace std;
int main() {
string s1;
cin >> s1;
int i = 0, j = 1, count = 0, sum = 1;
if (s1.size() == 1)
{
cout << 1 << endl;
exit(0);
}
while (j < s1.size()) {
if (s1[j - 1] == s1[j] || s1[j] - s1[j - 1] == 1)
{
count++;
j++;
if (sum < count) {
sum = count;
}
continue;
}
count = 0;
i = j;
j = i + 1;
}
//sum = count;
cout << sum+1 << endl;
return 0;
}