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 Python (3.4.3) (judge verdict: Time Limit Exceeded)

s=input()
n=len(s)
# アルファベット(a〜z)→数値(1〜26)小文字限定
a2n = lambda c: ord(c) - ord('a') + 1
# 数値(1〜26)→アルファベット(a〜z)
n2a = lambda c: chr(c+64).lower()
d={}
d_={}
for i in range(1,27):
  d[n2a(i)]=[0]
  d_[n2a(i)]=0
for i in range(n):
  d_[s[i]]+=1
  for j in range(1,27):
    d[n2a(j)].append(2*d_[n2a(j)]-(i+1))
def func(l):
  mina=[0,0]
  for k in range(2,n+1):
    if mina[0]<l[k]:
      return [mina[1]+1,k]
    elif mina[0]>l[k-2]:
      mina=[l[k-2],k-2]
  return [-1,-1]
for i in range(1,27):
  tmp=func(d[n2a(i)])
  if tmp[0]>0:
    print(tmp[0],tmp[1])
    exit()
print(-1,-1)