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 Scala (2.11.7) (judge verdict: Wrong Answer)

object Main {
  def main(args: Array[String]) {
    val sc = new java.util.Scanner(System.in)
    val s = sc.next
    val unb = findUnbalance(s)
    println(unb(0) + " " + unb(1))
  }
  def findUnbalance(s: String) =  {
    if (s.length < 2) {
      Array(-1, -1) 
    } else if (s.length == 2) {
      if (s(0) == s(1)) Array(0, 1) else Array(-1, -1)
    } else {
    
    val N = s.length
    var unb = Array(-1, -1)
    for (i <- 0 until N-2) {
      val s1 = s(i)
      val s2 = s(i+1)
      val s3 = s(i+2)
      if (s1 == s2) unb = Array(i+1, i+2)
      if (s2 == s3) unb = Array(i+2, i+3)
      if (s1 == s3) unb = Array(i+1, i+3)
    }
    val u = unb
    u
    }
  }

}