Question 19
With positive integer $n \gt 1$, let $4n - 3$ positive numbers are written on the board (not necessarily all different). It is known that any 4 pairwise different numbers from that list form an arithmetic progression. Prove that some number is written on the board at least $n$ times.