def task3(text):
text = text.lower()
longest = 0
cur = 0
for ch in text:
if ch == 'k':
cur += 1
longest = max(longest, cur)
else:
cur = 0
return longest
ZGVmIHRhc2szKHRleHQpOgogICAgdGV4dCA9IHRleHQubG93ZXIoKQogICAgbG9uZ2VzdCA9IDAKICAgIGN1ciA9IDAKICAgIGZvciBjaCBpbiB0ZXh0OgogICAgICAgIGlmIGNoID09ICdrJzoKICAgICAgICAgICAgY3VyICs9IDEKICAgICAgICAgICAgbG9uZ2VzdCA9IG1heChsb25nZXN0LCBjdXIpCiAgICAgICAgZWxzZToKICAgICAgICAgICAgY3VyID0gMAogICAgcmV0dXJuIGxvbmdlc3QKCg==