Consider a hash table with $f(n)$ entries with a hash function that can uniformly dispatch items to those entries. Which property below ensures that a successful search can be done in $O(1)$?