Longest Substring Without Repeating Characters

Given a string \(s\), find the length of the longest substring without repeating characters.

You are required to write a program that reads the input string from standard input and prints the result to standard output.

For example, given the input "abcabcbb", the longest substring without repeating characters is "abc" which has a length of 3.

inputFormat

The input consists of a single line containing a string \(s\). The string may be empty and can contain both letters and digits.

outputFormat

Output the length of the longest substring without repeating characters as an integer.

0