There is a number $n \in \mathbb{N}, \ n > 1, n < 2^k$. How to prove this statement:  
 $n$ is included into Pascal triangle not more than $2k -2$ times?