def first(arr, x, n):
    left = 0
    right = n - 1
    answer = -1

    while left <= right:
        mid = (left + right) // 2

        if arr[mid] == x:
            answer = mid
            right = mid - 1
        elif arr[mid] < x:
            left = mid + 1
        else:
            right = mid - 1

    return answer