Pigeonhole and Extremal Arguments · Hard problem

Twenty-five integers are chosen. What is the largest $k$ such that you can be sure $k$ of them have the same remainder on division by $6$, AND those $k$ numbers have pairwise differences divisible by $6$?