{"problem":{"name":"Dango","description":{"content":"For a positive integer $L$, a level-$L$ dango string is a string that satisfies the following conditions. *   It is a string of length $L+1$ consisting of `o` and `-`. *   Exactly one of the first ch","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc299_c"},"statements":[{"statement_type":"Markdown","content":"For a positive integer $L$, a level-$L$ dango string is a string that satisfies the following conditions.\n\n*   It is a string of length $L+1$ consisting of `o` and `-`.\n*   Exactly one of the first character and the last character is `-`, and the other $L$ characters are `o`.\n\nFor instance, `ooo-` is a level-$3$ dango string, but none of `-ooo-`, `oo`, and `o-oo-` is a dango string (more precisely, none of them is a level-$L$ dango string for any positive integer $L$).\nYou are given a string $S$ of length $N$ consisting of the two characters `o` and `-`. Find the greatest positive integer $X$ that satisfies the following condition.\n\n*   There is a contiguous substring of $S$ that is a level-$X$ dango string.\n\nIf there is no such integer, print `-1`.\n\n## Constraints\n\n*   $1\\leq N\\leq 2\\times10^5$\n*   $S$ is a string of length $N$ consisting of `o` and `-`.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc299_c","tags":[],"sample_group":[["10\no-oooo---o","4\n\nFor instance, the substring `oooo-` corresponding to the $3$\\-rd through $7$\\-th characters of $S$ is a level-$4$ dango string. No substring of $S$ is a level-$5$ dango string or above, so you should print $4$."],["1\n-","\\-1\n\nOnly the empty string and `-` are the substrings of $S$. They are not dango strings, so you should print `-1`."],["30\n-o-o-oooo-oo-o-ooooooo--oooo-o","7"]],"created_at":"2026-03-03 11:01:14"}}