static int binarySearch(int x, int[] arr) {
        int left = 0;
        int right = arr.length;
        while (left < right) {
            int mid = (left + right) / 2;
            if (arr[mid] == x) {
                return arr[mid];
            } else if (x < arr[mid]) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return Integer.MIN_VALUE;
    }