length longest sequence repetitive digits

const N = readline()
longest = 1
t = []

for(i = 1; i < N.length; i++)
{
    if(N[i-1] != N[i])
    {
        t.push(longest)
        longest = 0
    }
    longest++
}
t.push(longest)
t.sort((a,b)=>b-a)
console.log(t[0])