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 C++14 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include<iostream>
#include<string>

int a[26][(int)1e5 + 1];
std::string in;

inline int over(int num) {
	return num / 2 + 1;
}

std::pair<int, int> solve() {
	for (int i = 0; i < in.size(); ++i) {
		for (int j = i + 1; j < in.size(); ++j) {
			for (int k = 0; k < 26; ++k) {
				if (over(j - i + 1) <= a[k][j + 1] - a[k][i])
					return std::make_pair(i + 1, j + 1);
			}
		}
	}
	return std::make_pair(-1, -1);
}

int main() {
	
	std::cin >> in;
	for (int i = 0; i<in.size(); ++i)
		a[in[i] - 'a'][i + 1] = 1;
	for (int i = 0; i < 26; ++i) {
		for (int j = 0; j < in.size(); ++j)
			a[i][j + 1] += a[i][j];
	}
	std::pair<int, int> p = solve();
	std::cout << p.first << ' ' << p.second << std::endl;
	return 0;
}