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.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner s = new Scanner(System.in);
		String str = s.next();

		Sub sub = new Sub();

		sub.test(str.length(), str, 'a');
		sub.test(str.length(), str, 'b');
		sub.test(str.length(), str, 'c');
		sub.test(str.length(), str, 'd');
		sub.test(str.length(), str, 'e');
		sub.test(str.length(), str, 'f');
		sub.test(str.length(), str, 'g');
		sub.test(str.length(), str, 'h');
		sub.test(str.length(), str, 'i');
		sub.test(str.length(), str, 'j');
		sub.test(str.length(), str, 'k');
		sub.test(str.length(), str, 'l');
		sub.test(str.length(), str, 'm');
		sub.test(str.length(), str, 'n');
		sub.test(str.length(), str, 'o');
		sub.test(str.length(), str, 'p');
		sub.test(str.length(), str, 'q');
		sub.test(str.length(), str, 'r');
		sub.test(str.length(), str, 's');
		sub.test(str.length(), str, 't');
		sub.test(str.length(), str, 'u');
		sub.test(str.length(), str, 'v');
		sub.test(str.length(), str, 'w');
		sub.test(str.length(), str, 'x');
		sub.test(str.length(), str, 'y');
		sub.test(str.length(), str, 'z');

		System.out.println("-1 -1");
	}
}

class Sub {
	void test(int strlen, String str, char chr) {
		int count = 0;
		int x = -1;
		int y = -1;
		for (int i = 0; i < strlen; i++) {
			if (str.charAt(i) == chr) {
				if (x == -1) {
					x = i;
					count++;
				} else {
					y = i;
					count++;
					if ((double) count * 2.0 / (y - x) >= 1) {
						x++;
						y++;
						System.out.println(x+ " " + y);
						System.exit(1);
					}
				}
			}
		}
	}
}