Worst-Case Binary Search Comparisons

A sorted array contains 1000 distinct values. Using binary search, what is the maximum number of midpoint comparisons needed to determine whether a target value is present?