A building entrance logs a sequence of badge-scan IDs (single characters) as employees walk in one after another. You are given the full scan sequence as a string s. Find the length of the longest contiguous streak of scans in which no badge ID repeats.
Input format
Line 1: a non-empty string s made of uppercase letters and digits (no spaces).
Output format
A single integer: the length of the longest contiguous substring of s with all distinct characters.
Constraints
- 1 ≤ |s| ≤ 100000
scontains only uppercase lettersA-Zand digits0-9.