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 Ruby (2.3.3) (judge verdict: Accepted)

def tanaka(arr)
    if arr[0]!=arr[1] && arr[0]!=arr[2] && arr[2]!=arr[1] 
    return false
    else return true
end
end

str=gets.chomp.split("")
ll=str.length
i=0
(ll-2).times{
    arr2=[str[i],str[i+1],str[i+2]]
    
    if  tanaka(arr2) && ll>=3
       
       puts "#{i+1} #{i+3}"
       break
    end
    
    
    
   i+=1 
}

if i==ll-2 && ll>=3
    puts "-1 -1"
end


if ll==2 && str[0]==str[1]
    puts "1 2"
    
    
elsif ll==2
     puts "-1 -1"
 end