Counting & Probability · Challenge problem

What is the smallest $n$ such that every set of $n$ distinct integers chosen from $\{1,2,\dots,30\}$ must contain two different numbers whose sum is divisible by $7$?