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

S = gets.chomp
size = S.size
s = []
size.times do |i|
  s.push(S[i])
end
s2 = s.sort.uniq

max_char = ""
max = 0
(s2.size).times do |i|
  tmp = S.count(s2[i])
  if(tmp > max)then
    max = tmp
    max_char = s2[i]
  end
end

rc_db = Hash.new #renzoku_char db
tmp_char = ""
size.times do |i|
  if(tmp_char=="")then
    tmp_char = S[i]
    #puts "push #{S[i]} to tmp_char"
  elsif(S[i] == tmp_char)then
    if(rc_db.has_key?(tmp_char))then
      rc_db[tmp_char] += 1
    else
      rc_db[tmp_char] = 2
    end
  else
    tmp_char = S[i]
  end
end

#p rc_db

#puts "max=#{max}, max_char=#{max_char}"

if(size%2==0)then
  kisu = 0
else
  kisu = 1
end

### add check
max_char_check = false
rc_db.each do |key,val|
  if(key==max_char)then
    max_char_check = true
  end
end
###

#if(max >= size/2+kisu)then
if(max >= size/2+kisu && max_char_check)then
  startp = S.index(max_char) + 1
  idx = 0
  size.times do |i|
    if(S[i]==max_char)then
      idx = i
    end
  end
  endp = idx + 1
  puts "#{startp} #{endp}"
else
  puts "-1 -1"
end