Problem:
Score : 400 points

Problem Statement

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.

You 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.

Constraints

2 ≦ |s| ≦ 10^5

s consists of lowercase letters.

Partial Score

200 points will be awarded for passing the test set satisfying 2 ≦ N ≦ 100.

Input

The input is given from Standard Input in the following format:

s

Output

If there exists no unbalanced substring of s, print -1 -1.

If there exists an unbalanced substring of s, let one such substring be s_a s_{a+1} ... s_{b} (1 ≦ a < b ≦ |s|), and print a b. If there exists more than one such substring, any of them will be accepted.

Sample Input 1

needed

Sample Output 1

2 5

The 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.

Sample Input 2

atcoder

Sample Output 2

-1 -1

The string atcoder contains no unbalanced substring.

Solution in Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.*;
public class Main {
    
    static int[] isBalanced(String s){
        int[] c = new int[256];
        int[] ch = new int[]{-1,-1};
        int len=s.length()/2,i=0;
        for (char o : s.toCharArray()) {
            c[(int)o]++;
            if(c[(int)o]>len) { ch[0]=0; ch[1]=i;  }
            i++;
        }
        return ch;
    }

    static void solve(){
        Scanner sc = new Scanner(System.in);
        int[] ch={-1,-1};
        boolean ok = false;
        String s = sc.next();
        int n = s.length();
        // O(n^2) Can we do better? Maybe..
        for (int i=0; i<n-1; i++) {
            for (int j=n; j>=i+2; j--) {
                ch = isBalanced(s.substring(i,j));
                ok=(ch[0]>-1&&ch[1]>-1);
                if(ok) { break; }
            }  
            if(ok) break;
        }   
        System.out.println((ok) ? (ch[0]+1)+" "+(ch[1]+1): "-1 -1");
        sc.close();
    }
    
    public static void main(String args[]) {
        solve();
    }

}