For an open hashing scheme with $1000$ buckets and $2000$ records,

What is the maximum number of reads it takes to locate a record $?$

$($show all work otherwise zero credit$)$