Longest Substring Without Repeating Characters

Given a string ( s ), your task is to determine the length of the longest substring without repeating characters. A substring is defined as a contiguous sequence of characters within the string. For example, if ( s = \texttt{"abcabcbb"} ), the longest substring without any repeating characters is ( \texttt{"abc"} ) with a length of 3.

Note: The input will be provided via standard input (stdin) and the result should be output to standard output (stdout).

inputFormat

The input consists of a single line containing the string ( s ). The string may be empty or consist of any printable characters.

outputFormat

Output a single integer which represents the length of the longest substring of ( s ) that does not contain any repeating characters.## sample

abcabcbb

3