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 JavaScript (Node.js 12.16.1) (judge verdict: Accepted)

function Main(input) {
  input=input.split("\n");
　const STRING=input[0];
  var previous1,previous2;
  if(STRING[0]===STRING[1]){
    console.log(1,2);
    return;
  }
  previous1=STRING[0];
  previous2=STRING[1];
  for(var i=2;i<STRING.length;i++){
    if(STRING[i]==previous1){
      console.log(i-1,i+1);
      return;
    }else if(STRING[i]==previous2){
      console.log(i,i+1);
      return;
    }
    previous1=STRING[i-1];
    previous2=STRING[i];
  }
  console.log(-1,-1);
}

//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));