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: Wrong Answer)

#include<cstdio>
#include<cstring>
const int N=100000;

char s[N+5];
int P[256],len;
bool f;

bool Pan(int k,int d)
{
	return k>(d>>1);
}

bool Find(int d)
{
	memset(P,0,sizeof(P));
	for(int i=1;i<=d;i++)
		if(Pan(++P[s[i]],d))
		{
			printf("1 %d\n",d);
			f=1; return true;
		}
	
	for(int i=d+1;i<=len;i++)
	{
		P[s[i-d]]--;
		if(Pan(++P[s[i]],d))
		{
			printf("%d %d\n",i,i+d-1);
			f=1; return true;
		}
	}
	return false;
}

int main()
{
	scanf("%s",s+1);
	len=strlen(s+1);
	
	int depth=3;
	while(depth<=len&&!Find(depth)) depth++;
	
	if(!f) puts("-1 -1");
	return 0;
}