In today's E problem, my submission used exactly n-1 queries for each n to give out the answer. Can this be proven to be the least number of queries needed or is a better bound achievable?