OBM 2016 Problem 2

Find the smallest number $n$ such that any set of $n$ ponts in a Cartesian plan, all of them with integer coordinates, contains two poitns such that the square of its mutual distance is a multiple of $2016$.