Rule U reads the word in rounds and then completes it, its answers determine the word, and it asks at most $250\sqrt{\log_2 n \cdot \log_2 \log_2 n}$ queries for $n \ge 4$.