Problem: 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.

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.

Examples

Input

needed


Output

2 5


Input

atcoder


Output

-1 -1

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class Main {

	static boolean flag = false;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();

		for(int i = 0; i < s.length()-1; i++) {
			String subst = s.substring(i, i+2);
			if(subst.charAt(0) == subst.charAt(1)) {
				System.out.println((i+1) + " " + (i+2));
				flag = true;
				break;
			}
		}

		if(!flag) {
		for(int i = 0; i < s.length()-2; i++) {
			String subst = s.substring(i, i+3);
			if(subst.charAt(0) == subst.charAt(2)) {
				System.out.println((i+1) + " " + (i+3));
				flag = true;
				break;
			}
		}
		}

		if(!flag) System.out.println("-1 -1");

//		int half = s.length() / 2;
//		int[] count = new int[26];
//		for(int i = 0; i < 26; i++) {
//			count[i] = 0;
//		}
//
//
//		for(int i = 2; i < s.length(); i++) {
//			int startIndex = 0;
//			int endIndex = i;
//			while(endIndex <= s.length()) {
//				check(s, startIndex, endIndex);
//				startIndex++;
//				endIndex++;
//				if(flag) break;
//			}
//			if(flag) break;
//		}
//
//		if(!flag)System.out.println("-1 -1");
//	}
//
//	static void check(String s, int beginIndex, int endIndex) {
//		String subst = s.substring(beginIndex, endIndex);
//		HashMap<Character, Integer> count = new HashMap<Character, Integer>();
//		for(int i = 0; i < s.length(); i++) {
//			char temp = s.charAt(i);
//			if(!count.containsKey(temp)) {
//				count.put(temp, 1);
//			}else {
//				count.replace(temp, count.get(temp)+1);
//			}
//
//			if(count.get(temp) > (endIndex - beginIndex) / 2) {
//				System.out.println((beginIndex+1) + " " + (endIndex));
//				flag = true;
//				break;
//			}
//		}
	}

}