{"problem":{"name":"Shrinking","description":{"content":"Snuke can change a string $t$ of length $N$ into a string $t'$ of length $N - 1$ under the following rule: *   For each $i$ ($1 ≤ i ≤ N - 1$), the $i$\\-th character of $t'$ must be either the $i$\\-th","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc016_a"},"statements":[{"statement_type":"Markdown","content":"Snuke can change a string $t$ of length $N$ into a string $t'$ of length $N - 1$ under the following rule:\n\n*   For each $i$ ($1 ≤ i ≤ N - 1$), the $i$\\-th character of $t'$ must be either the $i$\\-th or $(i + 1)$\\-th character of $t$.\n\nThere is a string $s$ consisting of lowercase English letters. Snuke's objective is to apply the above operation to $s$ repeatedly so that all the characters in $s$ are the same. Find the minimum necessary number of operations.\n\n## Constraints\n\n*   $1 ≤ |s| ≤ 100$\n*   $s$ consists of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$s$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc016_a","tags":[],"sample_group":[["serval","3\n\nOne solution is: `serval` → `srvvl` → `svvv` → `vvv`."],["jackal","2\n\nOne solution is: `jackal` → `aacaa` → `aaaa`."],["zzz","0\n\nAll the characters in $s$ are the same from the beginning."],["whbrjpjyhsrywlqjxdbrbaomnw","8\n\nIn $8$ operations, he can change $s$ to `rrrrrrrrrrrrrrrrrr`."]],"created_at":"2026-03-03 11:01:13"}}