ELMO SL 2017 G3

Call the ordered pair of distinct circles $(\omega, \gamma)$ scribable if there exists a triangle with circumcircle $\omega$ and incircle $\gamma$ . Prove that among $n$ distinct circles there are at most $(n/2)^2$ scribable pairs.

[i]Proposed by Daniel Liu