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 extends App {
  import scala.util.control.Breaks

  def solve(s: String): (Int, Int) = {
    val checkTwo   = s.toCharArray.sliding(2).forall(l => l.head != l.tail.head)
    val checkThree = s.toCharArray.sliding(3).forall(l => l.head != l.tail.last)
    if (checkTwo && checkThree) (-1, -1)
    else {
      val b1    = new Breaks
      var start = -1
      var end   = -1
      b1.breakable {
        for ((e, i) <- s.toCharArray.sliding(2).zipWithIndex) {
          if (e.head == e.tail.head) {
            start = i
            end = i + 1
            b1.break
          }
        }
      }
      val b2 = new Breaks
      b2.breakable {
        for ((e, i) <- s.toCharArray.sliding(3).zipWithIndex) {
          if (e.head == e.tail.last) {
            start = i
            end = i + 2
            b2.break
          }
        }
      }
      (start, end)
    }
  }

  val sc = new java.util.Scanner(Console.in)
  val s  = sc.next()
  val t  = solve(s)
  println(s"${t._1} ${t._2}")
}