Pigeonhole and Extremal Arguments · Hard problem

What is the smallest number of different integers you must choose from $\{1, 2, \ldots, 50\}$ to be sure that two of them differ by $1$, $2$ or $3$?