Network Packet Optimization

Description:
In the field of computer networks, efficient data transfer is crucial. When sending data over a network, it's often necessary to break down large packets into smaller, manageable chunks to ensure reliable transmission. However, each chunk must have a unique identifier to prevent duplication and ensure correct reassembly at the receiving end. The goal is to find the maximum length of consecutive packets that can be sent without repeating any packet identifier.

Input Format

• The first line contains a string s (0 ≤ s.length ≤ 5 * 10^4), representing the sequence of packet identifiers.
• Each character in the string corresponds to a unique packet identifier.

Constraints

• The string s consists of English letters, digits, symbols, and spaces, representing different packet identifiers.
• The maximum length of the input string is 5 * 10^4 characters.

Output Format

• The length of the longest substring without repeating packet identifiers.

Examples

Input 1:

abcabcbb

Output 1:

3

Input 2:

bbbbb

Output 2:

1

Input 3:

pwwkew

Output 3:

3