Hidden Points

**This is an interactive task** There is an array $P$ of size $N$ consisting of distinct integer points on a 2D plane. $P$ are initially hidden from you, but you can ask queries to find out information about points in $P$. To be specific, you can ask queries in the form: `? i j` where $1 \le i \lt j \le N$, and you will be provided with the **square** of the Euclidean distance between $P_i$ a