{"raw_statement":[{"iden":"problem statement","content":"Given a string $t$, we will call it _unbalanced_ if and only if the length of $t$ is at least $2$, and more than half of the letters in $t$ are the same. For example, both `voodoo` and `melee` are unbalanced, while neither `noon` nor `a` is.\nYou are given a string $s$ consisting of lowercase letters. Determine if there exists a (contiguous) substring of $s$ that is unbalanced. If the answer is positive, show a position where such a substring occurs in $s$."},{"iden":"constraints","content":"*   $2 ≦ |s| ≦ 10^5$\n*   $s$ consists of lowercase letters."},{"iden":"partial score","content":"*   $200$ points will be awarded for passing the test set satisfying $2 ≦ N ≦ 100$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$s$"},{"iden":"sample input 1","content":"needed"},{"iden":"sample output 1","content":"2 5\n\nThe string $s_2 s_3 s_4 s_5$ $=$ `eede` is unbalanced. There are also other unbalanced substrings. For example, the output `2 6` will also be accepted."},{"iden":"sample input 2","content":"atcoder"},{"iden":"sample output 2","content":"\\-1 -1\n\nThe string `atcoder` contains no unbalanced substring."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}