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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

    public static void main(String[] args) throws Exception {
	    String input = Io.read();

	    Searcher searcher = new Searcher();
	    int[] result = searcher.search(input);

        String ans = String.format("%d %d", result[0], result[1]);

        Io.write(ans);
    }
}

class Searcher {
    public int[] search(String input) {
        int[] result = {-1, -1};

        char startStr;
        char nextStr;
        char endStr;

        for(int i = 0; i < input.length() - 3; i++) {
            startStr = input.charAt(i);
            nextStr = input.charAt(i + 1);
            endStr = input.charAt(i + 2);

            int checkRes = checkSame(startStr, nextStr, endStr);

            if (checkRes != 0) {
                result[0] = i + 1;
                result[1] = i + checkRes + 1;
                break;
            }
        }

        return result;
    }

    private int checkSame(char a, char b, char c) {
        if (a == b) {
            return 1;
        } else if (a == c) {
            return 2;
        } else {
            return 0;
        }
    }
}

class Io {

    /**
     * 標準入力から1行ずつ受け取る
     * @return
     * @throws IOException
     */
    public static String read() throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line = br.readLine();

        br.close();
        return line;
    }

    /**
     * 標準出力
     * @param line
     */
    public static void write(String line)
    {
        System.out.println(line);
    }
}