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: Time Limit Exceeded)

import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String S = sc.next();
		Map<String, List<Integer>> map = new HashMap<String, List<Integer>>();
		for (int i=0; i<S.length(); i++) {
			String s = String.valueOf(S.charAt(i));
			List<Integer> list = map.get(s);
			if (list==null) {
				list = new LinkedList<Integer>();
				map.put(s, list);
			}
			list.add(i);
		}
		for (String s: map.keySet()) {
			Integer[] list = map.get(s).toArray(new Integer[0]);
			if (list.length<2) continue;
			for (int i=0; i<list.length; i++) {
				for (int j=i+1; j<list.length; j++) {
					int charNum = j-i+1;
					int charLen = list[j]-list[i]+1;
					if (charNum<=charLen/2) continue;
					System.out.printf("%d %d\n", list[i]+1, list[j]+1);
					sc.close();
					return;
				}
			}
		}
		System.out.println("-1 -1");
		sc.close();
	}

}