using System;

public class Program

{

  public static void Main()

  {

    Test();

  }

  // Values in sortedArray are always sorted from lower to higher

  // Returns index of valueToFind in the sortedArray

  // Return -1 if valueToFind not found

  public static int Chop(int valueToFind, int [] sortedArray)

  {

    // TODO implement it!

  }

  public static void Test()

  {

    AssertEqual(-1, Chop(3, new int[] {}));

    AssertEqual(-1, Chop(3, new int[] {1}));

    AssertEqual(0,  Chop(1, new int[] {1}));

​

    AssertEqual(0,  Chop(1, new int[] {1, 3, 5}));

    AssertEqual(1,  Chop(3, new int[] {1, 3, 5}));

    AssertEqual(2,  Chop(5, new int[] {1, 3, 5}));

    AssertEqual(-1, Chop(0, new int[] {1, 3, 5}));

    AssertEqual(-1, Chop(2, new int[] {1, 3, 5}));

    AssertEqual(-1, Chop(4, new int[] {1, 3, 5}));

    AssertEqual(-1, Chop(6, new int[] {1, 3, 5}));

​

    AssertEqual(0,  Chop(1, new int[] {1, 3, 5, 7}));

    AssertEqual(1,  Chop(3, new int[] {1, 3, 5, 7}));

    AssertEqual(2,  Chop(5, new int[] {1, 3, 5, 7}));

    AssertEqual(3,  Chop(7, new int[] {1, 3, 5, 7}));

    AssertEqual(-1, Chop(0, new int[] {1, 3, 5, 7}));

    AssertEqual(-1, Chop(2, new int[] {1, 3, 5, 7}));

    AssertEqual(-1, Chop(4, new int[] {1, 3, 5, 7}));

    AssertEqual(-1, Chop(6, new int[] {1, 3, 5, 7}));

    AssertEqual(-1, Chop(8, new int[] {1, 3, 5, 7}));

  }

​

  public static void AssertEqual(int a, int b)

  {

    if (a != b)

    {

      Console.WriteLine("Should be "+a+" but got "+b);

    }

    else

    {

      Console.WriteLine("Correct");

    }

  }

}