Counting & Probability · Challenge problem

What is the smallest $n$ such that every $n$-element subset of $\{1,2,\dots,50\}$ contains two numbers whose difference is exactly $4$ or exactly $8$?