#929. Longest substring without repeats
You get a string. Find the length of the longest substring (characters next to each other) with no repeated character.
### Input
One line.
### Output
A number.
Examples
Input
eadefcbeba
Output
6
Input
afe
Output
3
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.