A Grover search is used on an unstructured database with 1,000,000 equally likely entries and one marked entry. Approximately how many oracle iterations are needed near the optimal point?