Pigeonhole and Extremal Arguments · Hard problem

What is the smallest number of integers you must choose from $\{1, 2, \ldots, 30\}$ to be sure that two of the chosen numbers have a sum divisible by $7$?