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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Text;
using System.Linq;
using System.Numerics;


class Program
{
    public void Proc()
    {
        Reader.IsDebug = false;
        string inpt = Reader.ReadLine();

        for (int i = 0; i < inpt.Length; i++)
        {
            if (!PosDic.ContainsKey(inpt[i]))
            {
                PosDic.Add(inpt[i], new List<int>());
            }
            PosDic[inpt[i]].Add(i);
        }

        foreach (char key in PosDic.Keys)
        {

            int[] ret = this.GetAns(PosDic[key]);
            if (ret != null)
            {
                Console.WriteLine(ret[0] + " " + ret[1]);
                return;
            }
        }
        Console.WriteLine("-1 -1");


    }

    private int[] GetAns(List<int> idxList)
    {
        if (idxList.Count <= 1)
        {
            return null;
        }

        for (int i = 2; i <= 3; i++)
        {
            for (int j = 0; j < idxList.Count - (i - 1); j++)
            {
                if (idxList[j + i - 1] - idxList[j] < i * 2 - 1)
                {
                    return new int[] {idxList[j] + 1, idxList[j + i - 1] + 1};
                }

            }
        }
        return null;
    }

    private Dictionary<char, List<int>> PosDic = new Dictionary<char, List<int>>();



    public class Reader
    {
        public static bool IsDebug = true;
        private static String PlainInput = @"

atcoder

";
        private static System.IO.StringReader Sr = null;
        public static string ReadLine()
        {
            if (IsDebug)
            {
                if (Sr == null)
                {
                    Sr = new System.IO.StringReader(PlainInput.Trim());
                }
                return Sr.ReadLine();
            }
            else
            {
                return Console.ReadLine();
            }
        }
    }
    static void Main()
    {
        Program prg = new Program();
        prg.Proc();
    }
}