Treasure Hunt

There is a $2 \times 2$ box of treasure hidden somewhere in a $5 \times 5$ grid. The rows are numbered from $1$ to $5$, as are the columns, with cell $(1,1)$ being the top left corner of the grid. Your goal is to find the treasure within $5$ queries. You can query a grid cell and ask if there is any part of the treasure chest in that grid cell. After at most $5$ queries, you must output the upper left coordinate of the treasure box.