Given a number $n$, recall that a number divided by $n$ can have $n$ possible remainders.
Now consider the $n$ numbers
$$1; 11; 111; \cdots; \underbrace{11\ldots1}_{n\,\, 1\text{'s}}$$
If one of the above leaves a remainder $0$, we are done. If none of them leave a remainder $0$, by pigeonhole principle, since we have $n$ numbers and $n-1$ remainders (recall none of them have a remainder zero), two of them leave the same remainder. Subtract the smaller from the larger to get what you want.
As an example, let us see for $n=6$. Consider the numbers,
$$1; 11; 111; 1111; 11111; 111111$$
Note that none of them leave a remainder $0$.
$1$ leaves a remainder $1$.
$11$ leaves a remainder $5$.
$111$ leaves a remainder $3$.
$1111$ leaves a remainder $1$.
$11111$ leaves a remainder $5$.
$111111$ leaves a remainder $3$.
Since $1$ and $1111$ leave the same remainder, subtract $1$ from $1111$ to get $1110$ and clearly $6 \vert 1110$.