// Java program to check fixed point

// in an array using binary search

class Main {

    static int binarySearch(int arr[], int low, int high)

    {

        if (high >= low) {

            int mid = low + (high - low) / 2;

            if (mid == arr[mid])

                return mid;

            int res = -1;

            if (mid + 1 <= arr[high])

                res = binarySearch(arr, (mid + 1), high);

            if (res != -1)

                return res;

            if (mid - 1 >= arr[low])

                return binarySearch(arr, low, (mid - 1));

        }

        /* Return -1 if there is no Fixed Point */

        return -1;

    }

    // main function

    public static void main(String args[])

    {

        int arr[] = { -10, -1, 0, 3, 10, 11, 30, 50, 100 };

        int n = arr.length;

        System.out.println("Fixed Point is "

                           + binarySearch(arr, 0, n - 1));

    }

}