Given a sorted array of distinct positive integers A[1..n], does there exist any index i satisfying A[i] = i? Give a (log n)-time algorithm to return such an i if one exists. If there are multiple different such indices i, you can return any of them; if there are none, return -1.