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

import java.util.*;
public class Main {
	
	
	public static void main(String[] args) {
		String alpha = "abcdefghijklmnopqrstuvwxyz";
		Scanner sc = new Scanner(System.in);
		String in = sc.nextLine();
		
		int len = in.length();
		int kahansu = in.length() /2;
		char[] inArray = in.toCharArray();
		int [] counter = new int[alpha.length()];
		boolean isUnblance = false;
//		System.out.println(len + ":"+ kahansu );
		for (int i = 0; i < inArray.length;i++) {
			String moji = Character.toString(inArray[i]);

			int j = alpha.indexOf(moji);
			counter[j]++;
//			System.out.println(moji + ":"+ j + ":" + counter[j]);
		}
		int index = 0;
		String unblanceMoji = "";
		for (int i = 0;i < counter.length; i++ ) {
//			System.out.println(counter[i] + ":" + kahansu);
			if (counter[i] >= kahansu) {
//				System.out.println("isUnblance" + i);
				unblanceMoji = alpha.substring(i, i + 1);
				isUnblance = true;
				index = i;
				break;
			}
		}
		if (isUnblance) {
			System.out.println((in.indexOf(unblanceMoji) + 1) + " " + (in.lastIndexOf(unblanceMoji) + 1) );
		} else {
			System.out.println("-1 -1");
		}

	}
}