Enrico draws a square in the plane, and then secretly picks a point $P$ that is either situated
- inside the square,
- or outside the square,
- or on the boundary of the square.
Damiano sees the square drawn by Enrico, but does not know the position of the secret point $P$. Damiano may choose a straight line $\ell$ in the plane and show $\ell$ to Enrico. Enrico then truthfully answers Damiano whether the secret point $P$ lies on line $\ell$, and in case the point is not the line, on which side of $\ell$ this secret point is located.
Question: What is the smallest possible number of lines that Damiano can query so that he will discover with absolute certainty whether the secret point is inside, outside, or on the square?