Given is a directed graph with $28$ vertices, such that there do not exist vertices $u, v$, such that $u \rightarrow v$ and $v \rightarrow u$. Every $16$ vertices form a directed cycle. Prove that among any $17$ vertices, we can choose $15$ which form a directed cycle.