Binary Search Comparisons for 1024 Elements

A target is known to be present in a sorted array of 1024 distinct elements. What is the minimum worst-case number of yes/no comparisons required to identify its position?